Sciweavers

1534 search results - page 94 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
CONCUR
1999
Springer
15 years 10 months ago
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...
Christel Baier, Joost-Pieter Katoen, Holger Herman...
EUC
2007
Springer
16 years 1 days ago
Consensus-Driven Distributable Thread Scheduling in Networked Embedded Systems
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
Jonathan Stephen Anderson, Binoy Ravindran, E. Dou...
IPPS
2000
IEEE
15 years 10 months ago
Gang Scheduling with Memory Considerations
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job’s processes. An alternative is to...
Anat Batat, Dror G. Feitelson
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 11 months ago
A hardware pipeline for function optimization using genetic algorithms
Genetic Algorithms (GAs) are very commonly used as function optimizers, basically due to their search capability. A number of different serial and parallel versions of GA exist. ...
Malay Kumar Pakhira, Rajat K. De
154
Voted
SPDP
1991
IEEE
15 years 9 months ago
Parallel and distributed algorithms for finite constraint satisfaction problems
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
Ying Zhang, Alan K. Mackworth