2438 search results - page 36 / 488 » Scheduling problems for parallel and distributed systems |
137
click to vote
SBMF
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
130
click to vote
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
129
click to vote
ICS
1998
Tsinghua U.
15 years 8 months ago
1998
Tsinghua U.
The goal of High Performance Fortran (HPF) is to "address the problems of writing data parallel programs where the distribution of data affects performance", providing t...
149
click to vote
ANOR
2007
15 years 4 months ago
2007
This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) pa...
134
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
—Designing efficient scheduling algorithms is an important problem in a general class of networks with resourcesharing constraints, such as wireless networks and stochastic proc...