Search
Now showing items 1-10 of 12
Reducing the impact of spill code
(1998)
All graph-coloring register allocators rely on heuristics to arrive at a "good" answer to the NP-complete problem of allocation, resulting in suboptimal code.
We look at a post-pass to the allocator which removes unnecessary ...
Interprocedural pointer analysis for C
(1998)
Many powerful code optimization techniques rely on accurate information connecting the definitions and uses of values in a program. This information is difficult to produce for programs written with pointer-based languages ...
Perscriptive performance tuning: The R(X) approach
(1998)
Programmers often rely on performance analysis tools to provide feedback about the execution of their applications. However, the nature of this feedback is far from satisfactory. Often the feedback is purely descriptive ...
Compiler support for software prefetching
(1998)
Due to the growing disparity between processor speed and main memory speed, techniques that improve cache utilization and hide memory latency are often needed to help applications achieve peak performance. Compiler-directed ...
Measurement-based admission control in integrated-services networks
(1998)
To satisfy the quality of service requirements of real-time multimedia applications, networks must employ resource reservation and admission control. In this paper, we describe a new Measurement-Based Admission Control ...
Improving the speed vs. accuracy tradeoff for simulating shared-memory multiprocessors with ILP processors
(1998)
Current simulators for shared-memory multiprocessor architectures involve a large tradeoff between simulation speed and accuracy. Most simulators assume much simpler processors than the current generation of processors ...
Efficient runtime support for cluster-based distributed shared memory multiprocessors
(1998)
Distributed shared memory (DSM) systems provide a shared memory programming paradigm on top of a physically distributed network of computers. The DSM system removes the necessity for programmers to move data explicitly ...
Compiling reductions in data parallel programs for distributed memory multiprocessors
(1998)
Reduction recognition and optimization are crucial techniques in parallelizing compilers. They are used to detect the recurrences in a program and transform the originally sequential code into parallel code. Because of the ...
Improved software pipelining for superscalar architectures
(1998)
Although instruction scheduling is an scNP-complete problem (27), many techniques have been developed to improve pipelining efficiency. Among them, several were proposed for scVLIW machines, and were shown to be efficient ...
The design and implementation of a new network subsystem architecture for server systems
(1998)
The explosive growth of the Internet, the widespread use of WWW-related applications, and the increased reliance on client-server architectures places interesting new demands on network servers. In particular, the operating ...