Sciweavers

3202 search results - page 605 / 641
» Memory access scheduling
Sort
View
PODC
2010
ACM
13 years 11 months ago
The multiplicative power of consensus numbers
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
Damien Imbs, Michel Raynal
IJNSEC
2007
110views more  IJNSEC 2007»
13 years 7 months ago
A Light Weight Enhancement to RC4 Based Security for Resource Constrained Wireless Devices
The Wired Equivalent Privacy (WEP) uses the 64 bit RC4 secret key stream cipher as its layer 2 security protocol. Although the underlying RC4 cipher is secure, the potential reuse...
Chetan Nanjunda Mathur, K. P. Subbalakshmi
DAC
2009
ACM
14 years 8 months ago
Process variation characterization of chip-level multiprocessors
Within-die variation in leakage power consumption is substantial and increasing for chip-level multiprocessors (CMPs) and multiprocessor systems-on-chip. Dealing with this problem...
Lide Zhang, Lan S. Bai, Robert P. Dick, Li Shang, ...
CSCW
2010
ACM
14 years 4 months ago
Catchup: a useful application of time-travel in meetings
People are often required to catch up on information they have missed in meetings, because of lateness or scheduling conflicts. Catching up is a complex cognitive process where pe...
Simon Tucker, Ofer Bergman, Anand Ramamoorthy, Ste...
CLUSTER
2009
IEEE
14 years 2 months ago
Reducing network contention with mixed workloads on modern multicore, clusters
Abstract—Multi-core systems are now extremely common in modern clusters. In the past commodity systems may have had up to two or four CPUs per compute node. In modern clusters, t...
Matthew J. Koop, Miao Luo, Dhabaleswar K. Panda