Sciweavers

107 search results - page 17 / 22
» Finding optimal hardware software partitions
Sort
View
ML
2007
ACM
101views Machine Learning» more  ML 2007»
13 years 6 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
SENSYS
2010
ACM
13 years 5 months ago
Evolution and sustainability of a wildlife monitoring sensor network
As sensor network technologies become more mature, they are increasingly being applied to a wide variety of applications, ranging from agricultural sensing to cattle, oceanic and ...
Vladimir Dyo, Stephen A. Ellwood, David W. Macdona...
CGO
2004
IEEE
13 years 11 months ago
Physical Experimentation with Prefetching Helper Threads on Intel's Hyper-Threaded Processors
Pre-execution techniques have received much attention as an effective way of prefetching cache blocks to tolerate the everincreasing memory latency. A number of pre-execution tech...
Dongkeun Kim, Shih-Wei Liao, Perry H. Wang, Juan d...
CASES
2003
ACM
14 years 17 days ago
Compiler-decided dynamic memory allocation for scratch-pad based embedded systems
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...
Sumesh Udayakumaran, Rajeev Barua
IEEEINTERACT
2003
IEEE
14 years 18 days ago
A Region-Based Compilation Infrastructure
: The traditional framework for back-end compilation is based on the scope of functions, which is a natural boundary to partition an entire program for compilation. However, the si...
Yang Liu, Zhaoqing Zhang, Ruliang Qiao, Roy Dz-Chi...