Sciweavers

4542 search results - page 603 / 909
» Design patterns for data structures
Sort
View
SIGCOMM
2005
ACM
16 years 6 days ago
A case study in building layered DHT applications
Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that ...
Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasa...
CLUSTER
2002
IEEE
15 years 6 months ago
Open Metadata Formats: Efficient XML-Based Communication for High Performance Computing
High-performance computing faces considerable change as the Internet and the Grid mature. Applications that once were tightly-coupled and monolithic are now decentralized, with co...
Patrick Widener, Greg Eisenhauer, Karsten Schwan, ...
TCS
2011
15 years 1 months ago
Highly concurrent multi-word synchronization
d Abstract) Hagit Attiya and Eshcar Hillel Department of Computer Science, Technion The design of concurrent data structures is greatly facilitated by the availability of synchroni...
Hagit Attiya, Eshcar Hillel
ACSAC
2009
IEEE
16 years 1 months ago
Protecting Commodity Operating System Kernels from Vulnerable Device Drivers
Device drivers on commodity operating systems execute with kernel privilege and have unfettered access to kernel data structures. Several recent attacks demonstrate that such poor...
Shakeel Butt, Vinod Ganapathy, Michael M. Swift, C...
WWW
2008
ACM
16 years 7 months ago
Scaling RDF with time
The World Wide Web Consortium's RDF standard primarily consists of (subject,property,object) triples that specify the value that a given subject has for a given property. How...
Andrea Pugliese, Octavian Udrea, V. S. Subrahmania...