Sciweavers

483 search results - page 73 / 97
» Timing Games and Shared Memory
Sort
View
ICPP
1999
IEEE
14 years 2 months ago
Improving Performance of Load-Store Sequences for Transaction Processing Workloads on Multiprocessors
On-line transaction processing exhibits poor memory behavior in high-end multiprocessor servers because of complex sharing patterns and substantial interaction between the databas...
Jim Nilsson, Fredrik Dahlgren
EURONGI
2006
Springer
14 years 1 months ago
Job Scheduling for Maximal Throughput in Autonomic Computing Systems
Abstract. Autonomic computing networks manage multiple tasks over a distributed network of resources. In this paper, we view an autonomic computing system as a network of queues, w...
Kevin Ross, Nicholas Bambos
PICS
2003
13 years 11 months ago
Efficient Mobile Imaging Using Emphasis Image Selection
Mobile imaging helps realize "any time, anywhere" visual communication by allowing consumers to capture, review, share, and print pictures via mobile devices while "...
Jiebo Luo, Amit Singhal, Andreas E. Savakis
TON
2002
175views more  TON 2002»
13 years 9 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
SIGMETRICS
2012
ACM
251views Hardware» more  SIGMETRICS 2012»
12 years 8 days ago
Providing fairness on shared-memory multiprocessors via process scheduling
Competition for shared memory resources on multiprocessors is the most dominant cause for slowing down applications and makes their performance varies unpredictably. It exacerbate...
Di Xu, Chenggang Wu, Pen-Chung Yew, Jianjun Li, Zh...