Sciweavers

1534 search results - page 60 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
SAGA
2005
Springer
14 years 1 months ago
Self-replication, Evolvability and Asynchronicity in Stochastic Worlds
We consider temporal aspects of self-replication and evolvability – in particular, the massively asynchronous parallel and distributed nature of living systems. Formal views of s...
Chrystopher L. Nehaniv
ISPAN
1999
IEEE
14 years 1 days ago
Evaluation of a Semi-Static Approach to Mapping Dynamic Iterative Tasks onto Heterogeneous Computing Systems
To minimize the execution time of an iterative application in a heterogeneous parallel computing environment, an appropriate mapping scheme is needed for matching and scheduling th...
Yu-Kwong Kwok, Anthony A. Maciejewski, Howard Jay ...
JSSPP
2009
Springer
14 years 2 months ago
The Gain of Overbooking
This paper analyzes the effect of overbooking for scheduling systems in a commercial environment. In this scenario each job is associated with a release time and a finishing deadl...
Georg Birkenheuer, André Brinkmann, Holger ...
LATIN
1998
Springer
13 years 12 months ago
The CREW PRAM Complexity of Modular Inversion
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
Joachim von zur Gathen, Igor Shparlinski
IPPS
1998
IEEE
14 years 19 hour ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser