Sciweavers

202 search results - page 10 / 41
» Complexity of Collective Communications on NoCs
Sort
View
INFOCOM
2012
IEEE
11 years 9 months ago
Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Nick...
EOR
2008
136views more  EOR 2008»
13 years 7 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
PODC
2000
ACM
13 years 11 months ago
Garbage collection of timestamped data in Stampede
Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of...
Rishiyur S. Nikhil, Umakishore Ramachandran
ICESS
2005
Springer
14 years 26 days ago
CDP: Component Development Platform for Communication Protocols
Complexity of software systems has significantly grown with social dependence on computer system, especially for mobile and internet. So we present component-based communication pr...
Hong-Jun Dai, Tian-Zhou Chen, Chun Chen, Jiang-Wei...
DASC
2006
IEEE
14 years 1 months ago
Service Clouds: A Distributed Infrastructure for Constructing Autonomic Communication Services
Abstract— This paper describes Service Clouds, a distributed infrastructure designed to facilitate rapid prototyping and deployment of services that enhance communication perform...
Philip K. McKinley, Farshad A. Samimi, Jonathan K....