Sciweavers

1406 search results - page 128 / 282
» Software trace cache
Sort
View
137
Voted
CASES
2003
ACM
15 years 7 months 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
POPL
2007
ACM
16 years 2 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
131
Voted
PLDI
2005
ACM
15 years 7 months ago
Code placement for improving dynamic branch prediction accuracy
Code placement techniques have traditionally improved instruction fetch bandwidth by increasing instruction locality and decreasing the number of taken branches. However, traditio...
Daniel A. Jiménez
94
Voted
WWW
2003
ACM
15 years 7 months ago
DNS Resolution with Renewal Using Piggyback
: Domain name system (DNS) is a primary identification mechanism for Internet applications. However, DNS resolutions often take an unbearably long time, and this could seriously i...
Baekcheol Jang, Kilnam Chon
102
Voted
CIKM
1995
Springer
15 years 5 months ago
Using Speculation to Reduce Server Load and Service Time on the WWW
Speculative service implies that a client's request for a document is serviced by sending, in addition to the document requested, a number of other documents (or pointers the...
Azer Bestavros