Sciweavers

3267 search results - page 539 / 654
» Generalized quasirandom graphs
Sort
View
IPPS
2006
IEEE
16 years 13 days ago
Using virtual grids to simplify application scheduling
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...
Richard Y. Huang, Henri Casanova, Andrew A. Chien
IPPS
2006
IEEE
16 years 13 days ago
Relationships between communication models in networks using atomic registers
A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In ...
Lisa Higham, Colette Johnen
MICRO
2006
IEEE
73views Hardware» more  MICRO 2006»
16 years 13 days ago
Merging Head and Tail Duplication for Convergent Hyperblock Formation
VLIW and EDGE (Explicit Data Graph Execution) architectures rely on compilers to form high-quality hyperblocks for good performance. These compilers typically perform hyperblock f...
Bertrand A. Maher, Aaron Smith, Doug Burger, Kathr...
PADS
2006
ACM
16 years 11 days ago
Modeling Autonomous-System Relationships
The development of realistic topology generators that produce faithful replicas of Internet topologies is critical for conducting realistic simulation studies of Internet protocol...
Xenofontas A. Dimitropoulos, George F. Riley
PLDI
2006
ACM
16 years 11 days ago
A global progressive register allocator
This paper describes a global progressive register allocator, a register allocator that uses an expressive model of the register allocation problem to quickly find a good allocat...
David Ryan Koes, Seth Copen Goldstein