Sciweavers

2479 search results - page 24 / 496
» A Computational Theory of Working Memory
Sort
View
SPAA
2003
ACM
14 years 24 days ago
The complexity of verifying memory coherence
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith
OSDI
1994
ACM
13 years 8 months ago
Storage Alternatives for Mobile Computers
Mobile computers such as notebooks, subnotebooks, and palmtops require low weight, low power consumption, and good interactive performance. These requirements impose many challeng...
Fred Douglis, Ramón Cáceres, M. Fran...
MICRO
2009
IEEE
137views Hardware» more  MICRO 2009»
14 years 2 months ago
ESKIMO: Energy savings using Semantic Knowledge of Inconsequential Memory Occupancy for DRAM subsystem
Dynamic Random Access Memory (DRAM) is used as the bulk of the main memory in most computing systems and its energy and power consumption has become a first-class design considera...
Ciji Isen, Lizy Kurian John
SIGMETRICS
1996
ACM
118views Hardware» more  SIGMETRICS 1996»
13 years 11 months ago
Integrating Performance Monitoring and Communication in Parallel Computers
A large and increasing gap exists between processor and memory speeds in scalable cache-coherent multiprocessors. To cope with this situation, programmers and compiler writers mus...
Margaret Martonosi, David Ofelt, Mark Heinrich
HICSS
2006
IEEE
109views Biometrics» more  HICSS 2006»
14 years 1 months ago
Towards Using Technological Support of Group Memory in Problem-Solving Situations to Improve Self- and Collective Efficacy
Bandura’s theories of self- and collective efficacy are widely recognized in many fields, including psychology and management, but have been largely unnoticed by the Human-Compu...
Christopher Paul Middup, Peter Johnson