Sciweavers

425 search results - page 54 / 85
» Requirements, specifications, and minimal refinement
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 1 days ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
WSC
2001
13 years 9 months ago
Distributed simulation with incorporated APS procedures for high-fidelity supply chain optimization
Tactical and operational planning for manufacturing enterprises are more important today than ever before as their supply chains span the globe. Two state-of-the-art technologies ...
Peter Lendermann, Boon-Ping Gan, Leon F. McGinnis
PLDI
1990
ACM
13 years 11 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
PDPTA
2004
13 years 9 months ago
Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
Roger Zimmermann, Beomjoo Seo
DAC
2006
ACM
14 years 8 months ago
Programming models and HW-SW interfaces abstraction for multi-processor SoC
ing models and HW-SW Interfaces Abstraction for Multi-Processor SoC Ahmed A. Jerraya TIMA Laboratory 46 Ave Felix Viallet 38031 Grenoble CEDEX, France +33476574759 Ahmed.Jerraya@im...
Ahmed Amine Jerraya, Aimen Bouchhima, Fréd&...