Sciweavers

166 search results - page 14 / 34
» On the Feasibility of Bandwidth Detouring
Sort
View
TKDE
2012
199views Formal Methods» more  TKDE 2012»
11 years 11 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
BIRTHDAY
2006
Springer
14 years 21 days ago
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities
Consider a simple network flow problem in which there are n channels directed from a source to a sink. The channel capacities are unknown and we wish to determine a feasible netwo...
Richard M. Karp, Till Nierhoff, Till Tantau
TPDS
2008
164views more  TPDS 2008»
13 years 8 months ago
Hierarchical Scheduling for Symmetric Multiprocessors
Hierarchical scheduling has been proposed as a scheduling technique to achieve aggregate resource partitioning among related groups of threads and applications in uniprocessor and...
Abhishek Chandra, Prashant J. Shenoy
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 9 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
EUROPAR
2003
Springer
14 years 2 months ago
FOBS: A Lightweight Communication Protocol for Grid Computing
The advent of high-performance networks in conjunction with low-cost, powerful computational engines has made possible the development of a new set of technologies termed computat...
Phillip M. Dickens