42 search results - page 6 / 9 » Provably Efficient Scheduling for Languages with Fine-Graine... |
SPAA
1997
ACM
14 years 3 days ago
1997
ACM
A parallel multithreaded program that is ostensibly deterministic may nevertheless behave nondeterministically due to bugs in the code. These bugs are called determinacy races, an...
PLSA
1994
14 years 19 days ago
1994
Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...
ASPLOS
1992
ACM
14 years 20 days ago
1992
ACM
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
MICRO
1996
IEEE
14 years 22 days ago
1996
IEEE
A machine description facility allows compiler writers to specify machine execution constraints to the optimization and scheduling phases of an instruction-level parallelism (ILP)...
PLDI
1996
ACM
14 years 21 days ago
1996
ACM
High performance compilers increasingly rely on accurate modeling of the machine resources to efficiently exploit the instruction level parallelism of an application. In this pape...