Sciweavers

1534 search results - page 26 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
VLDB
1994
ACM
153views Database» more  VLDB 1994»
13 years 11 months ago
Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
Waqar Hasan, Rajeev Motwani
EUROPAR
2005
Springer
14 years 1 months ago
Automatic Tuning of PDGEMM Towards Optimal Performance
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
Sascha Hunold, Thomas Rauber
EUC
2006
Springer
13 years 11 months ago
On Multiprocessor Utility Accrual Real-Time Scheduling with Statistical Timing Assurances
We present the first Utility Accrual (or UA) real-time scheduling algorithm for multiprocessors, called gMUA. The algorithm considers an application model where real-time activiti...
Hyeonjoong Cho, Haisang Wu, Binoy Ravindran, E. Do...
IPPS
2008
IEEE
14 years 2 months ago
A modeling approach for estimating execution time of long-running scientific applications
In a Grid computing environment, resources are shared among a large number of applications. Brokers and schedulers find matching resources and schedule the execution of the applic...
Seyed Masoud Sadjadi, Shu Shimizu, Javier Figueroa...
SPDP
1993
IEEE
13 years 11 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld