Sciweavers

3628 search results - page 513 / 726
» Approaching the Physical Limits of Computing
Sort
View
189
Voted
IEEEPACT
2000
IEEE
15 years 11 months ago
Global Register Partitioning
Modern computers have taken advantage of the instruction-level parallelism (ILP) available in programs with advances in both architecture and compiler design. Unfortunately, large...
Jason Hiser, Steve Carr, Philip H. Sweany
ICS
1999
Tsinghua U.
15 years 11 months ago
An experimental evaluation of tiling and shackling for memory hierarchy management
On modern computers, the performance of programs is often limited by memory latency rather than by processor cycle time. To reduce the impact of memory latency, the restructuring ...
Induprakas Kodukula, Keshav Pingali, Robert Cox, D...
DCC
1998
IEEE
15 years 11 months ago
The Context Trees of Block Sorting Compression
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
N. Jesper Larsson
ICPP
1998
IEEE
15 years 11 months ago
Techniques for Delayed Binding of Monitoring Mechanisms to Application-Specific Instrumentation Points
Online interaction with computer systems and applications allows developers to monitor, experiment with, and debug long-running, resource-intensive applicationsat runtime. Traditi...
Jeffrey S. Vetter, Karsten Schwan
IPPS
1998
IEEE
15 years 11 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot