1534 search results - page 124 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
PODC
2003
ACM
14 years 3 months ago
2003
ACM
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
ANSS
2002
IEEE
14 years 3 months ago
2002
IEEE
Efficient scheduling of jobs on parallel processors is essential for good performance. However, design of such schedulers is challenging because of the complex interaction between...
SPAA
1990
ACM
14 years 2 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
HPCC
2009
Springer
14 years 2 months ago
2009
Springer
Compared with lock-based synchronization techniques, Software Transactional Memory (STM) can significantly improve the programmability of multithreaded applications. Existing res...
EUROPAR
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Accurately modeling and predicting performance for largescale applications becomes increasingly difficult as system complexity scales dramatically. Analytic predictive mo...