107 search results - page 17 / 22 » Finding optimal hardware software partitions |
81
Voted
ML
2007
ACM
14 years 11 months ago
2007
ACM
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...
153
click to vote
SENSYS
2010
ACM
14 years 9 months ago
2010
ACM
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 ...
CGO
2004
IEEE
15 years 3 months ago
2004
IEEE
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...
105
Voted
CASES
2003
ACM
15 years 4 months ago
2003
ACM
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...
IEEEINTERACT
2003
IEEE
15 years 5 months ago
2003
IEEE
: 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...