Sciweavers

945 search results - page 117 / 189
» Working the Flow
Sort
View
ICUMT
2009
14 years 7 months ago
An efficient solution for max-min fair rate allocation in P2P simulation
Abstract--With the rapid development of peer-to-peer networks, simulation is considered as a useful tool to demonstrate initial ideas before building prototypes with real network t...
Anh Tuan Nguyen, Frank Eliassen
CORR
2010
Springer
96views Education» more  CORR 2010»
14 years 5 months ago
Quantifying Information Leakage in Finite Order Deterministic Programs
Information flow analysis is a powerful technique for reasoning about the sensitive information exposed by a program during its execution. While past work has proposed information...
Ji Zhu, Mudhakar Srivatsa
PRESENCE
2010
76views more  PRESENCE 2010»
14 years 4 months ago
Modularity for Large Virtual Reality Applications
This paper focuses on the design of high performance VR applications. These applications usually involve various I/O devices and complex simulations. A parallel architecture or gri...
Jérémie Allard, Jean-Denis Lesage, B...
SIGMETRICS
2010
ACM
115views Hardware» more  SIGMETRICS 2010»
14 years 4 months ago
The average response time in a heavy-traffic srpt queue
Shortest Remaining Processing Time first (SRPT) has long been known to optimize the queue length distribution and the mean response time (a.k.a. flow time, sojourn time). As such,...
Minghong Lin, Adam Wierman, Bert Zwart
MOBISYS
2008
ACM
15 years 9 months ago
Composcan: adaptive scanning for efficient concurrent communications and positioning with 802.11
Using 802.11 concurrently for communications and positioning is problematic, especially if location-based services (e.g., indoor navigation) are concurrently executed with real-ti...
Mikkel Baun Kjærgaard, Thomas King