On the complexity of list scheduling algorithms for distributed-memory systems

A Radulescu, AJC van Gemund

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

43 Citations (Scopus)

Original language	Undefined/Unknown
Title of host publication	Conference proceedings
Place of Publication	New York
Publisher	Association for Computing Machinery (ACM)
Pages	68-75
Number of pages	8
ISBN (Print)	1-58113-164-X
Publication status	Published - 1999
Event	1999 International Conference on Supercomputing, Rhodes - New York Duration: 20 Jun 1999 → 25 Jun 1999

Name
Publisher	Association for Computing Machinery

Conference	1999 International Conference on Supercomputing, Rhodes
Period	20/06/99 → 25/06/99

Keywords

@inproceedings{97c70baea20f4f9cbeca65ef05271f09,

title = "On the complexity of list scheduling algorithms for distributed-memory systems",

keywords = "ZX Int.klas.verslagjaar < 2002",

author = "A Radulescu and {van Gemund}, AJC",

year = "1999",

language = "Undefined/Unknown",

isbn = "1-58113-164-X",

publisher = "Association for Computing Machinery (ACM)",

pages = "68--75",

booktitle = "Conference proceedings",

address = "United States",

note = "1999 International Conference on Supercomputing, Rhodes ; Conference date: 20-06-1999 Through 25-06-1999",

}

TY - GEN

T1 - On the complexity of list scheduling algorithms for distributed-memory systems

AU - Radulescu, A

AU - van Gemund, AJC

PY - 1999

Y1 - 1999

KW - ZX Int.klas.verslagjaar < 2002

M3 - Conference contribution

SN - 1-58113-164-X

SP - 68

EP - 75

BT - Conference proceedings

PB - Association for Computing Machinery (ACM)

CY - New York

T2 - 1999 International Conference on Supercomputing, Rhodes

Y2 - 20 June 1999 through 25 June 1999

ER -