Sciweavers

2485 search results - page 365 / 497
» Time Bounded Frequency Computations
Sort
View
MIDDLEWARE
2007
Springer
14 years 2 months ago
New Worker-Centric Scheduling Strategies for Data-Intensive Grid Applications
Distributed computations, dealing with large amounts of data, are scheduled in Grid clusters today using either a task-centric mechanism, or a worker-centric mechanism. Because of ...
Steven Y. Ko, Ramsés Morales, Indranil Gupt...
STACS
2007
Springer
14 years 2 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Robert Elsässer, Thomas Sauerwald
IPPS
2006
IEEE
14 years 2 months ago
Performance Analysis of the Reactor Pattern in Network Services
The growing reliance on services provided by software applications places a high premium on the reliable and efficient operation of these applications. A number of these applicat...
Swapna S. Gokhale, Aniruddha S. Gokhale, Jeffrey G...
WG
2004
Springer
14 years 1 months ago
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
FOCS
2003
IEEE
14 years 1 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...