Sciweavers

2542 search results - page 473 / 509
» An Operational Definition of Context
Sort
View
GLOBECOM
2006
IEEE
15 years 6 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
HPDC
2006
IEEE
15 years 6 months ago
Adaptive I/O Scheduling for Distributed Multi-applications Environments
The aIOLi project aims at optimizing the I/O accesses within the cluster by providing a simple POSIX API, thus avoiding the constraints to use a dedicated parallel I/O library. Th...
Adrien Lebre, Yves Denneulin, Guillaume Huard, Prz...
ICPP
2006
IEEE
15 years 6 months ago
Data Transfers between Processes in an SMP System: Performance Study and Application to MPI
— This paper focuses on the transfer of large data in SMP systems. Achieving good performance for intranode communication is critical for developing an efficient communication s...
Darius Buntinas, Guillaume Mercier, William Gropp
102
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
How to Select a Good Alternate Path in Large Peer-to-Peer Systems?
Abstract— When multiple paths are available between communicating hosts, application quality can be improved by switching among them to always use the best one. The key to such a...
Teng Fei, Shu Tao, Lixin Gao, Roch Guérin
102
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
Generalized Proportional Fair Scheduling in Third Generation Wireless Data Networks
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
Tian Bu, L. Li, Ramachandran Ramjee