Sciweavers

1758 search results - page 123 / 352
» Schedule processes, not VCPUs
Sort
View
EPIA
1999
Springer
15 years 11 months ago
YapOr: an Or-Parallel Prolog System Based on Environment Copying
YapOr is an or-parallel system that extends the Yap Prolog system to exploit implicit or-parallelism in Prolog programs. It is based on the environment copying model, as first imp...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
SERP
2008
15 years 8 months ago
Mapping Data-Flow Dependencies onto Distributed Embedded Systems
Model-driven development (MDD) is an emerging paradigm and has become state-of-the-art for embedded systems software design. In the overall design process, several steps have to be...
Stefan Kugele, Wolfgang Haberl
ISPDC
2005
IEEE
16 years 9 days ago
A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling ...
Daniel Grosu, Thomas E. Carroll
ICASSP
2009
IEEE
16 years 1 months ago
Low-delay scheduling for Grassmannian beamforming with a SINR constraint
We are presenting an algorithm for scheduling users in a single-cell broadcast scenario. The presented algorithm aims to minimize the number of transmissions that are necessary to...
Claude Simon, Geert Leus
LATIN
2000
Springer
15 years 10 months ago
Approximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...