CONSTRUCTIONS OF PERMUTATION ARRAYS FOR CERTAIN SCHEDULING COST MEASURES

Authors
NAOR J ROTH RM
Citation
J. Naor et Rm. Roth, CONSTRUCTIONS OF PERMUTATION ARRAYS FOR CERTAIN SCHEDULING COST MEASURES, Random structures & algorithms, 6(1), 1995, pp. 39-50
Citations number
18
Categorie Soggetti
Mathematics,Mathematics,Mathematics,"Computer Science Software Graphycs Programming
Journal title
Random structures & algorithms → ACNP
ISSN journal
10429832
Volume
6
Issue
1
Year of publication
1995
Pages
39 - 50
Database
ISI
SICI code
1042-9832(1995)6:1<39:COPAFC>2.0.ZU;2-J
Abstract
Constructions of permutation arrays are presented that are optimal or nearly-optimal with respect to two cost measures: the so-called longes t-jump measure and the longest-monoton-greedy-subsequence measure. The se measures arise in the context of scheduling problems in asynchronou s, shared memory, multiprocessor machines. (C) 1995 John Wiley & Sons, Inc.