Sciweavers

3202 search results - page 284 / 641
» Memory access scheduling
Sort
View
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
15 years 11 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
JIIS
2008
104views more  JIIS 2008»
15 years 6 months ago
Transaction Management for Flash Media Databases in Portable Computing Environments
Flash memory is becoming a major database storage in building embedded systems or portable devices because of its non-volatile, shock-resistant, power-economic nature, and fast acc...
Siwoo Byun
VLSID
2005
IEEE
102views VLSI» more  VLSID 2005»
16 years 7 months ago
Integrated On-Chip Storage Evaluation in ASIP Synthesis
An Application Specific Instruction Set Processor (ASIP) exploits special characteristics of the given application(s) to meet the desired performance, cost and power requirements....
Manoj Kumar Jain, M. Balakrishnan, Anshul Kumar
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
16 years 1 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
ASPLOS
2000
ACM
15 years 11 months ago
Frequent Value Locality and Value-Centric Data Cache Design
By studying the behavior of programs in the SPECint95 suite we observed that six out of eight programs exhibit a new kind of value locality, the frequent value locality, according...
Youtao Zhang, Jun Yang 0002, Rajiv Gupta