Sciweavers

287 search results - page 35 / 58
» Introducing parallelism and concurrency in the data structur...
Sort
View
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
16 years 1 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
MIDDLEWARE
2005
Springer
15 years 6 months ago
Dual-Quorum Replication for Edge Services
This paper introduces dual-quorum replication, a novel data replication algorithm designed to support Internet edge services. Dual-quorum replication combines volume leases and qu...
Lei Gao, Michael Dahlin, Jiandan Zheng, Lorenzo Al...
ICDCS
2002
IEEE
15 years 6 months ago
Key Trees and the Security of Interval Multicast
A key tree is a distributed data structure of security keys that can be used by a group of users. In this paper, we describe how any user in the group can use the different keys i...
Mohamed G. Gouda, Chin-Tser Huang, E. N. Elnozahy
PLDI
2010
ACM
15 years 6 months ago
Bamboo: a data-centric, object-oriented approach to many-core software
Traditional data-oriented programming languages such as dataflow s and stream languages provide a natural abstraction for parallel programming. In these languages, a developer fo...
Jin Zhou, Brian Demsky
IPPS
2006
IEEE
15 years 7 months ago
Making lockless synchronization fast: performance implications of memory reclamation
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
Thomas E. Hart, Paul E. McKenney, Angela Demke Bro...