PLDI
1998
ACM
13 years 10 months ago
1998
ACM
Achieving good performance in bytecoded language interpreters is di cult without sacri cing both simplicity and portability. This is due to the complexity of dynamic translation (...
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
The conditional branch has long been considered an expensive operation. The relative cost of conditional branches has increased as recently designed machines are now relying on de...
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
This paper presents a typed programming language and compiler for run-time code generation. The language, called ML2, extends ML with modal operators in the style of the Mini-ML2 ...
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
A linear-scan algorithm directs the global allocation of register candidates to registers based on a simple linear sweep over the program being compiled. This approach to register...
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
Object-oriented applications may contain data members that can be removed from the application without a ecting program behavior. Such \dead" data members may occur due to un...
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
In conventional superscalar microarchitectures with partitioned integer and floating-point resources, all floating-point resources are idle during execution of integer programs....
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
Existing array region representation techniques are sensitive to the complexity of array subscripts. In general, these techniques are very accurate and efficient for simple subscr...
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
The fth release of the multithreaded language Cilk uses a provably good \work-stealing" scheduling algorithm similar to the rst system, but the language has been completely r...