Sciweavers

1675 search results - page 215 / 335
» Implementing Data Cubes Efficiently
Sort
View
135
Voted
APCSAC
2001
IEEE
15 years 7 months ago
High-Performance Extendable Instruction Set Computing
In this paper, a new architecture called the extendable instruction set computer (EISC) is introduced that addresses the issues of memory size and performance in embedded micropro...
Heui Lee, Paul Becket, Bill Appelbe
EUROPAR
2000
Springer
15 years 7 months ago
Cache Remapping to Improve the Performance of Tiled Algorithms
With the increasing processing power, the latency of the memory hierarchy becomes the stumbling block of many modern computer architectures. In order to speed-up the calculations, ...
Kristof Beyls, Erik H. D'Hollander
CPM
2009
Springer
131views Combinatorics» more  CPM 2009»
15 years 7 months ago
Linear Time Suffix Array Construction Using D-Critical Substrings
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
Ge Nong, Sen Zhang, Wai Hong Chan
117
Voted
FAST
2008
15 years 5 months ago
AWOL: An Adaptive Write Optimizations Layer
Operating system memory managers fail to consider the population of read versus write pages in the buffer pool or outstanding I/O requests when writing dirty pages to disk or netw...
Alexandros Batsakis, Randal C. Burns, Arkady Kanev...
ANCS
2008
ACM
15 years 5 months ago
On runtime management in multi-core packet processing systems
Computer networks require increasingly complex packet processing in the data path to adapt to new functionality requirements. To meet performance demands, packet processing system...
Qiang Wu, Tilman Wolf