Sciweavers

94 search results - page 17 / 19
» Improved Bounds on Relaxations of a Parallel Machine Schedul...
Sort
View
JSSPP
2007
Springer
14 years 1 months ago
A Self-optimized Job Scheduler for Heterogeneous Server Clusters
Heterogeneous clusters and grid infrastructures are becoming increasingly popular. In these computing infrastructures, machines have different resources, including memory sizes, d...
Elad Yom-Tov, Yariv Aridor
PODC
2003
ACM
14 years 23 days ago
Asynchronous resource discovery
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
Ittai Abraham, Danny Dolev
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
13 years 11 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
HPCA
2011
IEEE
12 years 11 months ago
ACCESS: Smart scheduling for asymmetric cache CMPs
In current Chip-multiprocessors (CMPs), a significant portion of the die is consumed by the last-level cache. Until recently, the balance of cache and core space has been primari...
Xiaowei Jiang, Asit K. Mishra, Li Zhao, Ravishanka...
SPAA
1998
ACM
13 years 11 months ago
Elimination Forest Guided 2D Sparse LU Factorization
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
Kai Shen, Xiangmin Jiao, Tao Yang