Sciweavers

1534 search results - page 90 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
CCGRID
2008
IEEE
13 years 11 months ago
Benefits of Job Exchange between Autonomous Sites in Decentralized Computational Grids
This paper examines the job exchange between parallel compute sites in a decentralized Grid scenario. Here, the local scheduling system remains untouched and continues normal oper...
Christian Grimme, Joachim Lepping, Alexander Papas...
OPODIS
2010
13 years 7 months ago
An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
Danny Hendler, Shay Kutten, Erez Michalak
ACMSE
2008
ACM
13 years 11 months ago
Parallel processing flow models on desktop hardware
Numerical solution of any large, three-dimensional fluid flow problem is a computationally intensive task that typically requires supercomputer solution to achieve reasonable exec...
Robert Geist, Zachary Jones, Jay E. Steele
CORR
2011
Springer
197views Education» more  CORR 2011»
13 years 4 months ago
High-Throughput Transaction Executions on Graphics Processors
OLTP (On-Line Transaction Processing) is an important business system sector in various traditional and emerging online services. Due to the increasing number of users, OLTP syste...
Bingsheng He, Jeffrey Xu Yu
ICPADS
2006
IEEE
14 years 3 months ago
Ensuring Fairness Among Participating Clusters During Multi-site Parallel Job Scheduling
Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully m...
William M. Jones, Walter B. Ligon III