Sciweavers

167 search results - page 28 / 34
» An Algebraic Framework for Optimizing Parallel Programs
Sort
View
CASES
2003
ACM
14 years 22 days ago
Exploiting bank locality in multi-bank memories
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
Guilin Chen, Mahmut T. Kandemir, Hendra Saputra, M...
TSP
2008
107views more  TSP 2008»
13 years 7 months ago
Opportunistic Spectrum Access via Periodic Channel Sensing
The problem of opportunistic access of parallel channels occupied by primary users is considered. Under a continuous-time Markov chain modeling of the channel occupancy by the prim...
Qing Zhao, Stefan Geirhofer, Lang Tong, Brian M. S...
CCGRID
2001
IEEE
13 years 11 months ago
KelpIO: A Telescope-Ready Domain-Specific I/O Library for Irregular Block-Structured Applications
To ameliorate the need to spend significant programmer time modifying parallel programs to achieve highperformance, while maintaining compact, comprehensible source codes, this pa...
Bradley Broom, Robert J. Fowler, Ken Kennedy
ISLPED
2006
ACM
105views Hardware» more  ISLPED 2006»
14 years 1 months ago
Reducing power through compiler-directed barrier synchronization elimination
Interprocessor synchronization, while extremely important for ensuring execution correctness, can be very costly in terms of both power and performance overheads. Unfortunately, m...
Mahmut T. Kandemir, Seung Woo Son
FIDJI
2003
Springer
14 years 21 days ago
Hard Real-Time Implementation of Embedded Software in JAVA
The popular slogan ”write once, run anywhere” effectively renders the expressive capabilities of the Java programming framework for developing, deploying, and reusing target-i...
Jean-Pierre Talpin, Abdoulaye Gamatié, Davi...