Sciweavers

393 search results - page 11 / 79
» Personnel scheduling: Models and complexity
Sort
View
ICCAD
2005
IEEE
105views Hardware» more  ICCAD 2005»
15 years 8 months ago
Weighted control scheduling
Abstract — This paper describes a practical technique for the optimal scheduling of control dominated systems minimizing the weighted average latency over all control branches. S...
Aravind Vijayakumar, Forrest Brewer
SPAA
2003
ACM
15 years 5 months ago
The complexity of verifying memory coherence
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith
WSC
2007
15 years 2 months ago
A supply chain paradigm to model business pprocesses at the Y-12 National Security Complex
The NNSA’s Y-12 National Security Complex is a manufacturing facility operated by BWXT Y-12. Y-12’s missions include ensuring the US’ nuclear weapons deterrent, storing nucl...
Reid L. Kress, Jack Dixon, Thomas M. Insalaco, Ric...
ISPDC
2008
IEEE
15 years 6 months ago
Performance Analysis of Grid DAG Scheduling Algorithms using MONARC Simulation Tool
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...
Florin Pop, Ciprian Dobre, Valentin Cristea
IPPS
2007
IEEE
15 years 6 months ago
A Comparison of Dag-Scheduling Strategies for Internet-Based Computing
A fundamental challenge in Internet computing (IC) is to efficiently schedule computations having complex interjob dependencies, given the unpredictability of remote machines, in...
Robert Hall, Arnold L. Rosenberg, Arun Venkatarama...