Scheduling malleable and nonmalleable parallel tasks

Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1994, Pages 167-176

  Ludwig, Walter ^a   Tiwari, Prasoon ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; ELECTRIC NETWORK TOPOLOGY; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; SCHEDULING;

MALLEABLE PARALLEL TASKS; NONMALLEABLE PARALLEL TASKS;

STORAGE ALLOCATION (COMPUTER);

EID: 0028195126     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)