Sciweavers

6105 search results - page 779 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
175
Voted
CLUSTER
2005
IEEE
16 years 15 days ago
Efficient and Robust Computation of Resource Clusters in the Internet
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster
153
Voted
HPDC
2005
IEEE
16 years 14 days ago
Interest-aware information dissemination in small-world communities
Information dissemination is a fundamental and frequently occuring problem in large, dynamic, distributed systems. We propose a novel approach to this problem, interest-aware info...
Adriana Iamnitchi, Ian T. Foster
ICDCS
2005
IEEE
16 years 14 days ago
Fine-Grain Adaptive Compression in Dynamically Variable Networks
Despite voluminous previous research on adaptive compression, we found significant challenges when attempting to fully utilize both network bandwidth and CPU. We describe the Fine...
Calton Pu, Lenin Singaravelu
157
Voted
IPPS
2005
IEEE
16 years 14 days ago
Desynchronized Pfair Scheduling on Multiprocessors
Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical impl...
UmaMaheswari C. Devi, James H. Anderson
IPPS
2005
IEEE
16 years 14 days ago
Bootstrapping Free-Space Optical Networks
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
Fang Liu, Uzi Vishkin, Stuart Milner