Provably efficient scheduling for languages with fine-grained parallelism

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 1995, Pages 1-12

  Blelloch, Guy E ^a   Gibbons, Phillip B ^a   Matias, Yossi ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; DATA STRUCTURES; GRAPH THEORY; HIGH LEVEL LANGUAGES; MATRIX ALGEBRA; PARALLEL ALGORITHMS; PERFORMANCE; PROGRAM PROCESSORS; SCHEDULING; STORAGE ALLOCATION (COMPUTER); SYNCHRONIZATION; THEOREM PROVING;

ACYCLIC GRAPHS; CORRECTNESS; DEPTH-FIRST-LIKE TRAVERSALS; FINE-GRAINED PARALLELISM; NESTED LOOPS; PARALLEL LANGUAGES; PARALLEL PROGRAMMING; PSEUDO-CODE; SPACE BOUND;

PARALLEL PROCESSING SYSTEMS;

EID: 0029206424     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/215399.215403     Document Type: Conference Paper

References (42)