Sciweavers

7311 search results - page 192 / 1463
» Time in State Machines
Sort
View
IPCO
1998
152views Optimization» more  IPCO 1998»
15 years 6 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
HPDC
2008
IEEE
15 years 11 months ago
XenLoop: a transparent high performance inter-vm network loopback
Advances in virtualization technology have focused mainly on strengthening the isolation barrier between virtual machines (VMs) that are co-resident within a single physical machi...
Jian Wang, Kwame-Lante Wright, Kartik Gopalan
RTAS
1996
IEEE
15 years 8 months ago
Supporting the specification and analysis of timing constraints
Real-time programmers have to deal with the problem of relating timing constraints associated with source code to sequences of machine instructions. This paper describes an enviro...
Lo Ko, Christopher A. Healy, Emily Ratliff, Robert...
SCHEDULING
2008
152views more  SCHEDULING 2008»
15 years 4 months ago
Bicriteria robotic cell scheduling
This paper considers the scheduling problems arising in two- and three-machine manufacturing cells configured in a flowshop which repeatedly produces one type of product and where ...
Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan
CAV
1992
Springer
96views Hardware» more  CAV 1992»
15 years 8 months ago
State-Space Caching Revisited
State-space caching is a veri cation technique for nite-state concurrent systems. It performs an exhaustive exploration of the state space of the system being checked while storin...
Patrice Godefroid, Gerard J. Holzmann, Didier Piro...