Sciweavers

218 search results - page 39 / 44
» Making Paths Explicit in the Scout Operating System
Sort
View
ECOOP
2005
Springer
15 years 3 months ago
Interprocedural Analysis for Privileged Code Placement and Tainted Variable Detection
In Java 2 and Microsoft .NET Common Language Runtime (CLR), trusted code has often been programmed to perform accessrestricted operations not explicitly requested by its untrusted ...
Marco Pistoia, Robert J. Flynn, Larry Koved, Vugra...
IUI
2004
ACM
15 years 3 months ago
Sheepdog: learning procedures for technical support
Technical support procedures are typically very complex. Users often have trouble following printed instructions describing how to perform these procedures, and these instructions...
Tessa A. Lau, Lawrence D. Bergman, Vittorio Castel...
SIGMETRICS
2004
ACM
124views Hardware» more  SIGMETRICS 2004»
15 years 3 months ago
Interposed proportional sharing for a storage service utility
This paper develops and evaluates new share-based scheduling algorithms for differentiated service quality in network services, such as network storage servers. This form of resou...
Wei Jin, Jeffrey S. Chase, Jasleen Kaur
IMC
2010
ACM
14 years 7 months ago
The effect of packet loss on redundancy elimination in cellular wireless networks
Network-level redundancy elimination (RE) algorithms reduce traffic volume on bandwidth-constrained network paths by avoiding the transmission of repeated byte sequences. Previous...
Cristian Lumezanu, Katherine Guo, Neil Spring, Bob...
IMC
2003
ACM
15 years 2 months ago
On inferring and characterizing internet routing policies
Border Gateway Protocol allows Autonomous Systems (ASs) to apply diverse routing policies for selecting routes and for propagating reachability information to other ASs. Although ...
Feng Wang, Lixin Gao