Sciweavers

84 search results - page 14 / 17
» Schemes for SR-Tree packing
Sort
View
JSSPP
2004
Springer
14 years 29 days ago
Reconfigurable Gang Scheduling Algorithm
 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
Luís Fabrício Wanderley Góes,...
CLUSTER
2003
IEEE
14 years 28 days ago
Interstitial Computing: Utilizing Spare Cycles on Supercomputers
This paper presents an analysis of utilizing unused cycles on supercomputers through the use of many small jobs. What we call “interstitial computing,” is important to superco...
Stephen D. Kleban, Scott H. Clearwater
IPPS
2003
IEEE
14 years 27 days ago
Flexible CoScheduling: Mitigating Load Imbalance and Improving Utilization of Heterogeneous Resources
Fine-grained parallel applications require all their processes to run simultaneously on distinct processors to achieve good efficiency. This is typically accomplished by space sl...
Eitan Frachtenberg, Dror G. Feitelson, Fabrizio Pe...
ISPD
2003
ACM
88views Hardware» more  ISPD 2003»
14 years 26 days ago
Porosity aware buffered steiner tree construction
— In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis syste...
Charles J. Alpert, Gopal Gandham, Milos Hrkic, Jia...
ICRA
1998
IEEE
98views Robotics» more  ICRA 1998»
13 years 12 months ago
The Bow Leg Hopping Robot
The bow leg hopper is a novel locomotor design with a highly resilient leg that resembles an archer's bow. During flight, a "thrust" actuator adds elastic energy to...
Ben Brown, Garth Zeglin