Sciweavers

822 search results - page 117 / 165
» Contention in shared memory algorithms
Sort
View
116
Voted
HPCA
2005
IEEE
16 years 2 months ago
Improving Multiple-CMP Systems Using Token Coherence
Improvements in semiconductor technology now enable Chip Multiprocessors (CMPs). As many future computer systems will use one or more CMPs and support shared memory, such systems ...
Michael R. Marty, Jesse D. Bingham, Mark D. Hill, ...
115
Voted
IANDC
2006
77views more  IANDC 2006»
15 years 2 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
SPAA
1995
ACM
15 years 6 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp
MIR
2006
ACM
150views Multimedia» more  MIR 2006»
15 years 8 months ago
Exploring temporal consistency for video analysis and retrieval
Temporal consistency is ubiquitous in video data, where temporally adjacent video shots usually share similar visual and semantic content. This paper presents a thorough study of ...
Jun Yang 0003, Alexander G. Hauptmann
128
Voted
WWW
2004
ACM
16 years 3 months ago
Site-to-site (s2s) searching using the p2p framework with cgi
Peer-To-Peer (P2P) networks like Gnutella improve some shortcomings of Conventional Search Engines (CSE) such as centralized and outdated indexing by distributing the search engin...
Wan Yeung Wong