Sciweavers

1432 search results - page 213 / 287
» Hardness of robust network design
Sort
View
MMNS
2007
105views Multimedia» more  MMNS 2007»
15 years 7 months ago
Monitoring Flow Aggregates with Controllable Accuracy
In this paper, we show the feasibility of real-time flow monitoring with controllable accuracy in today’s IP networks. Our approach is based on Netflow and A-GAP. A-GAP is a prot...
Alberto Gonzalez Prieto, Rolf Stadler
HPDC
2007
IEEE
16 years 15 days ago
PeerStripe: a p2p-based large-file storage for desktop grids
In desktop grids the use of off-the-shelf shared components makes the use of dedicated resources economically nonviable and increases the complexity of design of efficient storag...
Chreston Miller, Patrick Butler, Ankur Shah, Ali R...
DAC
2002
ACM
16 years 7 months ago
Schedulability of event-driven code blocks in real-time embedded systems
Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Tasks in many such systems, like netwo...
Samarjit Chakraborty, Thomas Erlebach, Simon K&uum...
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
16 years 3 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich
TEI
2010
ACM
199views Hardware» more  TEI 2010»
16 years 1 months ago
Revealing the invisible: visualizing the location and event flow of distributed physical devices
Distributed physical user interfaces comprise networked sensors, actuators and other devices attached to a variety of computers in different locations. Developing such systems is ...
Nicolai Marquardt, Tom Gross, M. Sheelagh T. Carpe...