Constructions of permutation arrays for certain scheduling cost measures

  • Authors:

  • Joseph Naor;Ron M. Roth

  • Affiliations:

  • Computer Science Department, Technion–Israel Institute of Technology, Haifa 32000, Israel;Computer Science Department, Technion–Israel Institute of Technology, Haifa 32000, Israel

  • Venue:
  • Random Structures & Algorithms
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

Constructions of permutation arrays are presented that are optimal or nearly‐optimal with respect to two cost measures: the so‐called longest‐jump measure and the longest‐monotone‐greedy‐subsequence measure. These measures arise in the context of scheduling problems in asynchronous, shared memory, multiprocessor machines. © 1995 Wiley Periodicals, Inc.