Sciweavers

3678 search results - page 526 / 736
» On the Stable Paths Problem
Sort
View
IPPS
1998
IEEE
15 years 8 months ago
A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
Benjamin S. Macey, Albert Y. Zomaya
INFOCOM
1993
IEEE
15 years 8 months ago
Experimental Assessment of End-to-End Behavior on Internet
Over the last decade Internet has grown by orders of magnitude in size. Many of the protocols that were designed several years ago are still in use. It is not clear if the assumpt...
Dheeraj Sanghi, Ashok K. Agrawala, Olafur Gudmunds...
IPPS
1994
IEEE
15 years 8 months ago
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...
Carolyn McCreary, A. A. Khan, J. J. Thompson, M. E...
COMSWARE
2007
IEEE
15 years 8 months ago
An Efficient Scheme for Establishing Pairwise Keys for Wireless Sensor Networks
This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key pre-distribution technique. Inspired by the recent proxybased...
Abhishek Gupta, Pavan Nuggehalli, Joy Kuri
DSD
2009
IEEE
126views Hardware» more  DSD 2009»
15 years 8 months ago
Architecture-Driven Synthesis of Reconfigurable Cells
In this paper, we present a novel method for merging sets of computational patterns into a reconfigurable cell respecting design constraints and optimizing specific design aspects...
Christophe Wolinski, Krzysztof Kuchcinski, Erwan R...