Sciweavers

425 search results - page 54 / 85
» Requirements, specifications, and minimal refinement
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 4 months 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
165
Voted
WSC
2001
15 years 1 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
107
Voted
PLDI
1990
ACM
15 years 4 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
15 years 1 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
103
Voted
DAC
2006
ACM
16 years 1 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&...