Sciweavers

2555 search results - page 413 / 511
» Quantifiers and Working Memory
Sort
View
137
Voted
PLDI
1996
ACM
15 years 8 months ago
Fast, Effective Dynamic Compilation
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...
Joel Auslander, Matthai Philipose, Craig Chambers,...
133
Voted
ASPLOS
1994
ACM
15 years 7 months ago
Interleaving: A Multithreading Technique Targeting Multiprocessors and Workstations
There is an increasing trend to use commodity microprocessors as the compute engines in large-scale multiprocessors. However, given that the majority of the microprocessors are so...
James Laudon, Anoop Gupta, Mark Horowitz
133
Voted
CHI
1994
ACM
15 years 7 months ago
User learning and performance with marking menus
A marking menu is designed to allow a user to perform a menu selection by either popping-up a radial (or pie) menu, or by making a straight mark in the direction of the desired me...
Gordon Kurtenbach, William Buxton
ICS
1994
Tsinghua U.
15 years 7 months ago
Compiler and runtime support for out-of-core HPF programs
This paper describes the design of a compiler which can translate out-of-core programs written in a data parallel language like HPF. Such a compiler is required for compiling larg...
Rajeev Thakur, Rajesh Bordawekar, Alok N. Choudhar...
129
Voted
SC
1994
ACM
15 years 7 months ago
Run-time and compile-time support for adaptive irregular problems
In adaptive irregular problems the data arrays are accessed via indirection arrays, and data access patterns change during computation. Implementingsuch problems ondistributed mem...
Shamik D. Sharma, Ravi Ponnusamy, Bongki Moon, Yua...