Sciweavers

3098 search results - page 405 / 620
» On distributed smooth scheduling
Sort
View
IWOMP
2009
Springer
15 years 11 months ago
Dynamic Task and Data Placement over NUMA Architectures: An OpenMP Runtime Perspective
Abstract. Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-...
François Broquedis, Nathalie Furmento, Bric...
SPAA
1998
ACM
15 years 10 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
IPPS
1996
IEEE
15 years 10 months ago
Software Techniques for Improving MPP Bulk-Transfer Performance
Brewer and Kuszmaul [BK94] demonstrated how barriers and traffic interleaving can alleviate the problem of bulk-transfer performance degradation on the Thinking Machines CM-5, by ...
Eric A. Brewer, Paul Gauthier, Armando Fox, Angela...
CCGRID
2004
IEEE
15 years 10 months ago
Design and implementation of an OGSI-compliant Grid broker service
Grid computing promises the ability to share geographically and organizationally distributed resources to increase effective computational power and resource utilization. However,...
Youn-Seok Kim, Jung-Lok Yu, Jae-Gyoon Hahm, Jinsoo...
CCGRID
2004
IEEE
15 years 10 months ago
Predicting job start times on clusters
In a Computational Grid which consists of many computer clusters, job start time predictions are useful to guide resource selections and balance the workload distribution. However...
Hui Li, David L. Groep, Jeffrey Templon, Lex Wolte...