Sciweavers

2110 search results - page 107 / 422
» What is the complexity of a distributed computing system
Sort
View
INFOCOM
2009
IEEE
15 years 11 months ago
Locally vs. Globally Optimized Flow-Based Content Distribution to Mobile Nodes
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
Mhameed Aezladen, Reuven Cohen, Danny Raz
EUROPAR
2007
Springer
15 years 10 months ago
Content-Based Publish/Subscribe Using Distributed R-Trees
Publish/subscribe systems provide a useful paradigm for selective data dissemination and most of the complexity related to addressing and routing is encapsulated within the network...
Silvia Bianchi, Pascal Felber, Maria Gradinariu
IPPS
1998
IEEE
15 years 8 months ago
The Timewheel Group Membership Protocol
Abstract. We describe a group membership protocol, called the timewheel group membership protocol, for a timed asynchronous distributed system. This protocol is a part of the timew...
Shivakant Mishra, Christof Fetzer, Flaviu Cristian
GRID
2007
Springer
15 years 10 months ago
Data placement for scientific applications in distributed environments
— Scientific applications often perform complex computational analyses that consume and produce large data sets. We are concerned with data placement policies that distribute dat...
Ann L. Chervenak, Ewa Deelman, Miron Livny, Mei-Hu...
ATAL
2007
Springer
15 years 10 months ago
Distributed task allocation in social networks
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
Mathijs de Weerdt, Yingqian Zhang, Tomas Klos