Sciweavers

2756 search results - page 427 / 552
» Computation-Centric Memory Models
Sort
View
NGITS
1997
Springer
15 years 10 months ago
Faster Joins, Self Joins and Multi-Way Joins Using Join Indices
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross....
Hui Lei, Kenneth A. Ross
SPDP
1993
IEEE
15 years 10 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
CASES
2001
ACM
15 years 10 months ago
A system-on-a-chip lock cache with task preemption support
Intertask/interprocess synchronization overheads may be significant in a multiprocessor-shared memory System-on-a-Chip implementation. These overheads are observed in terms of loc...
Bilge Saglam Akgul, Jaehwan Lee, Vincent John Moon...
HICSS
1995
IEEE
128views Biometrics» more  HICSS 1995»
15 years 10 months ago
Instruction Level Parallelism
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
ASPLOS
2008
ACM
15 years 8 months ago
Accelerating two-dimensional page walks for virtualized systems
Nested paging is a hardware solution for alleviating the software memory management overhead imposed by system virtualization. Nested paging complements existing page walk hardwar...
Ravi Bhargava, Ben Serebrin, Francesco Spadini, Sr...