Sciweavers

162 search results - page 2 / 33
» Load Latency Tolerance in Dynamically Scheduled Processors
Sort
View
HPCA
2000
IEEE
13 years 9 months ago
Memory Dependence Speculation Tradeoffs in Centralized, Continuous-Window Superscalar Processors
We consider a variety of dynamic, hardware-based methods for exploiting load/store parallelism, including mechanisms that use memory dependence speculation. While previous work ha...
Andreas Moshovos, Gurindar S. Sohi
CCGRID
2001
IEEE
13 years 9 months ago
Latency Hiding in Dynamic Partitioning and Load Balancing of Grid Computing Applications
The Information Power Grid (IPG) concept developed by NASA is aimed to provide a metacomputing platform for large-scale distributed computations, by hiding the intricacies of a hig...
Sajal K. Das, Daniel J. Harvey, Rupak Biswas
ICDCS
1996
IEEE
13 years 9 months ago
Dynamic Scheduling Strategies for Shared-memory Multiprocessors
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
Babak Hamidzadeh, David J. Lilja
MICRO
2005
IEEE
110views Hardware» more  MICRO 2005»
13 years 10 months ago
Scalable Store-Load Forwarding via Store Queue Index Prediction
Conventional processors use a fully-associative store queue (SQ) to implement store-load forwarding. Associative search latency does not scale well to capacities and bandwidths re...
Tingting Sha, Milo M. K. Martin, Amir Roth
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
14 years 6 months ago
Dynamic Load Distribution in the Borealis Stream Processor
Distributed and parallel computing environments are becoming cheap and commonplace. The availability of large numbers of CPU's makes it possible to process more data at highe...
Ying Xing, Stanley B. Zdonik, Jeong-Hyon Hwang