Sciweavers

3202 search results - page 511 / 641
» Memory access scheduling
Sort
View
SPAA
1996
ACM
15 years 6 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
SIGOPSE
1994
ACM
15 years 6 months ago
New Directions for Integrated Circuit Cards Operating Systems
Integrated circuit cards or smart cards are now well-known. Applications such as electronic purses (cash units stored in cards), subscriber identification cards used in cellular te...
Pierre Paradinas, Jean-Jacques Vandewalle
CACM
2010
179views more  CACM 2010»
15 years 2 months ago
x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors
Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating syste...
Peter Sewell, Susmit Sarkar, Scott Owens, Francesc...
DKE
2008
79views more  DKE 2008»
15 years 2 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
IEEESP
2006
130views more  IEEESP 2006»
15 years 2 months ago
Securing Embedded Systems
t a single security abstraction layer, but rather is a roblem spanning multiple abstraction levels. We use an embedded biometric authentication device to demonstratethenecessityofa...
David Hwang, Patrick Schaumont, Kris Tiri, Ingrid ...