Sciweavers

2035 search results - page 101 / 407
» Working memory
Sort
View
ICLP
1993
Springer
15 years 7 months ago
On Copy Avoidance in Single Assignment Languages
: Copy avoidance refers to the safe replacement, at compile time, of copying operations by destructive updates in single-assignment languages. Conceptually, the problem can be divi...
Saumya K. Debray
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
15 years 7 months ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill
FAST
2011
14 years 6 months ago
Exploiting Half-Wits: Smarter Storage for Low-Power Devices
This work analyzes the stochastic behavior of writing to embedded flash memory at voltages lower than recommended by a microcontroller’s specifications to reduce energy consum...
Mastooreh Salajegheh, Yue Wang, Kevin Fu, Anxiao J...
JAVA
2001
Springer
15 years 7 months ago
Implementation of a portable software DSM in Java
Rapid commoditization of advanced hardware and progress of networking technology is now making wide area high-performance computing a.k.a. the ‘Grid’ Computing a reality. Sinc...
Yukihiko Sohda, Hidemoto Nakada, Satoshi Matsuoka
ISCA
1997
IEEE
96views Hardware» more  ISCA 1997»
15 years 7 months ago
DataScalar Architectures
DataScalar architectures improve memory system performance by running computation redundantly across multiple processors, which are each tightly coupled with an associated memory....
Doug Burger, Stefanos Kaxiras, James R. Goodman