Sciweavers

109 search results - page 21 / 22
» A Small IP Forwarding Table Using Hashing
Sort
View
PPOPP
2010
ACM
13 years 6 months ago
Helper locks for fork-join parallel programming
Helper locks allow programs with large parallel critical sections, called parallel regions, to execute more efficiently by enlisting processors that might otherwise be waiting on ...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
EDBT
2008
ACM
129views Database» more  EDBT 2008»
14 years 4 months ago
Design of PriServ, a privacy service for DHTs
By decentralizing control, P2P systems provide efficient, scalable data sharing. However, when sharing data for different purposes (e.g., billing, purchase, shipping, etc.), data ...
Mohamed Jawad, Patricia Serrano-Alvarado, Patrick ...
IPTPS
2005
Springer
13 years 10 months ago
Arpeggio: Metadata Searching and Content Sharing with Chord
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
Austin T. Clements, Dan R. K. Ports, David R. Karg...
SCN
2008
Springer
136views Communications» more  SCN 2008»
13 years 4 months ago
An efficient data structure for network anomaly detection
Abstract-- Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two...
Jieyan Fan, Dapeng Wu, Kejie Lu, Antonio Nucci
ICFP
2008
ACM
14 years 4 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...