Sciweavers

10805 search results - page 16 / 2161
» Mapping Computation with No Memory
Sort
View
DAC
1997
ACM
13 years 11 months ago
Data Memory Minimisation for Synchronous Data Flow Graphs Emulated on DSP-FPGA Targets
The paper presents an algorithm to determine the close-tosmallest possible data buffer sizes for arbitrary synchronous data flow (SDF) applications, such that we can guarantee the...
Marleen Adé, Rudy Lauwereins, J. A. Peperst...
HPCA
2012
IEEE
12 years 3 months ago
Balancing DRAM locality and parallelism in shared memory CMP systems
Modern memory systems rely on spatial locality to provide high bandwidth while minimizing memory device power and cost. The trend of increasing the number of cores that share memo...
Min Kyu Jeong, Doe Hyun Yoon, Dam Sunwoo, Mike Sul...
DAC
2007
ACM
14 years 8 months ago
A System For Coarse Grained Memory Protection In Tiny Embedded Processors
Many embedded systems contain resource constrained microcontrollers where applications, operating system components and device drivers reside within a single address space with no...
Ram Kumar, Akhilesh Singhania, Andrew Castner, Edd...
HICSS
1994
IEEE
117views Biometrics» more  HICSS 1994»
13 years 11 months ago
Providing for Organizational Memory in Computer-Supported Meetings
Meeting memory features are poorly integrated into current group support systems (GSS). This paper discusses how to introduce meeting memory functionality into a GSS. The paper fi...
Gerhard Schwabe
SIAMCOMP
2000
79views more  SIAMCOMP 2000»
13 years 7 months ago
Optimal Worst Case Formulas Comparing Cache Memory Associativity
ct Consider an arbitrary program P which is to be executed on a computer with two alternative cache memories. The rst cache has k sets and u blocks in each set, this is denoted a ...
Håkan Lennerstad, Lars Lundberg