Learn More
In this paper, we present a relatively primitive execution model for ne-grain par-allelism, in which all synchronization, scheduling, and storage management is explicit and under compiler control. This is dened by a threaded abstract machine (TAM) with a multilevel scheduling hierarchy. Considerable temporal locality of logically related threads is(More)
In this paper, we present a relatively primitive execution model for ne-grain par-allelism, in which all synchronization, scheduling, and storage management is explicit and under compiler control. This is deened by a threaded abstract machine (TAM) with a multilevel scheduling hierarchy. Considerable temporal locality of logically related threads is(More)
Wawrzynek. Fine-grain parallelism with minimal hardware support: A compiler-controlled threaded abstract machine. A fully abstract semantics for a rst-order functional language with logic variables. 10 leading to a communication channel for the result of the forked process. When the last process is forked sum suspends until that process nished its(More)
  • 1