Sciweavers

Share
HPCA
2011
IEEE
8 years 5 months ago
HAQu: Hardware-accelerated queueing for fine-grained threading on a chip multiprocessor
Queues are commonly used in multithreaded programs for synchronization and communication. However, because software queues tend to be too expensive to support finegrained paralle...
Sanghoon Lee, Devesh Tiwari, Yan Solihin, James Tu...
USS
2010
8 years 11 months ago
Cling: A Memory Allocator to Mitigate Dangling Pointers
Use-after-free vulnerabilities exploiting so-called dangling pointers to deallocated objects are just as dangerous as buffer overflows: they may enable arbitrary code execution. U...
Periklis Akritidis
IMC
2010
ACM
8 years 11 months ago
Selecting representative IP addresses for internet topology studies
An Internet hitlist is a set of addresses that cover and can represent the the Internet as a whole. Hitlists have long been used in studies of Internet topology, reachability, and...
Xun Fan, John Heidemann
IMC
2010
ACM
8 years 11 months ago
Internet background radiation revisited
The monitoring of packets destined for reachable, yet unused, Internet addresses has proven to be a useful technique for measuring a variety of specific Internet phenomenon (e.g.,...
Eric Wustrow, Manish Karir, Michael Bailey, Farnam...
IJHPCA
2010
117views more  IJHPCA 2010»
8 years 11 months ago
Fine-Grained Multithreading Support for Hybrid Threaded MPI Programming
As high-end computing systems continue to grow in scale, recent advances in multiand many-core architectures have pushed such growth toward more denser architectures, that is, mor...
Pavan Balaji, Darius Buntinas, David Goodell, Will...
CCR
2004
116views more  CCR 2004»
9 years 1 months ago
An empirical study of "bogon" route advertisements
An important factor in the robustness of the interdomain routing system is whether the routers in autonomous systems (ASes) filter routes for "bogon" address space--i.e....
Nick Feamster, Jaeyeon Jung, Hari Balakrishnan
MST
2006
136views more  MST 2006»
9 years 1 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
COMCOM
2010
90views more  COMCOM 2010»
9 years 1 months ago
The room shortage problem of tree-based ZigBee/IEEE 802.15.4 wireless networks
A number of IEEE 802.15.4 devices can form a tree topology as proposed by ZigBee specification. The ability to confine the shape and extent of the tree serves as the basis for add...
Li-Hsing Yen, Wei-Ting Tsai
WCE
2007
9 years 2 months ago
Sparse Matrix Multiplication Using UPC
—Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide,...
Hoda El-Sayed, Eric Wright
USENIX
2001
9 years 2 months ago
User-Level Checkpointing for LinuxThreads Programs
Multiple threads running in a single, shared address space is a simple model for writing parallel programs for symmetric multiprocessor (SMP) machines and for overlapping I/O and ...
William R. Dieter, James E. Lumpp Jr.
books