Sciweavers

874 search results - page 46 / 175
» Predicting the Running Times of Parallel Programs by Simulat...
Sort
View
IPPS
1999
IEEE
15 years 2 months ago
Dynamically Scheduling the Trace Produced During Program Execution into VLIW Instructions
VLIW machines possibly provide the most direct way to exploit instruction level parallelism; however, they cannot be used to emulate current general-purpose instruction set archit...
Alberto Ferreira de Souza, Peter Rounce
ASPLOS
2000
ACM
15 years 2 months ago
Slipstream Processors: Improving both Performance and Fault Tolerance
Processors execute the full dynamic instruction stream to arrive at the final output of a program, yet there exist shorter instruction streams that produce the same overall effec...
Karthik Sundaramoorthy, Zachary Purser, Eric Roten...
IPPS
2000
IEEE
15 years 2 months ago
The Parallelization of a Knowledge Discovery System with Hypergraph Representation
Abstract. Knowledge discovery is a time-consuming and space intensive endeavor. By distributing such an endeavor, we can diminish both time and space. System INDEDpronounced indee...
Jennifer Seitzer, James P. Buckley, Yi Pan, Lee A....
IEEEPACT
2002
IEEE
15 years 2 months ago
Cost Effective Memory Dependence Prediction using Speculation Levels and Color Sets
Memory dependence prediction allows out-of-order issue processors to achieve high degrees of instruction level parallelism by issuing load instructions at the earliest time withou...
Soner Önder
POPL
1997
ACM
15 years 1 months ago
Synchronization Transformations for Parallel Computing
As parallel machines become part of the mainstream computing environment, compilers will need to apply synchronization optimizations to deliver e cient parallel software. This pap...
Pedro C. Diniz, Martin C. Rinard