Sciweavers

16128 search results - page 80 / 3226
» Distributed network scheduling
Sort
View
FGCS
2000
143views more  FGCS 2000»
14 years 9 months ago
A data intensive distributed computing architecture for "Grid" applications
Modern scientific computing involves organizing, moving, visualizing, and analyzing massive amounts of data from around the world, as well as employing large-scale computation. The...
Brian Tierney, William E. Johnston, Jason Lee, Mar...
RTAS
2002
IEEE
15 years 2 months ago
RAP: A Real-Time Communication Architecture for Large-Scale Wireless Sensor Networks
Large-scale wireless sensor networks represent a new generation of real-time embedded systems with significantly different communication constraints from traditional networked sys...
Chenyang Lu, Brian M. Blum, Tarek F. Abdelzaher, J...
ICPADS
2006
IEEE
15 years 3 months ago
Efficient Compile-Time Task scheduling for Heterogeneous Distributed Computing Systems
Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (or HeDCSs). Because of its key importance, several scheduling...
Mohammad I. Daoud, Nawwaf N. Kharma
INFOCOM
2009
IEEE
15 years 4 months ago
On the Market Power of Network Coding in P2P Content Distribution Systems
Abstract—Network coding is emerging as a promising alternative to traditional content distribution approaches in P2P networks. By allowing information mixture in peers, it simpli...
Xinyu Zhang, Baochun Li
JISE
2002
165views more  JISE 2002»
14 years 9 months ago
Locality-Preserving Dynamic Load Balancing for Data-Parallel Applications on Distributed-Memory Multiprocessors
Load balancing and data locality are the two most important factors in the performance of parallel programs on distributed-memory multiprocessors. A good balancing scheme should e...
Pangfeng Liu, Jan-Jan Wu, Chih-Hsuae Yang