Sciweavers

2703 search results - page 221 / 541
» Optimizing memory transactions
Sort
View
ISPD
2000
ACM
108views Hardware» more  ISPD 2000»
15 years 9 months ago
A hybrid dynamic/quadratic programming algorithm for interconnect tree optimization
In this paper, we present an algorithm for delay minimization of interconnect trees by simultaneous buffer insertion/sizing and wire sizing. The algorithm integrates the quadratic...
Yu-Yen Mo, Chris C. N. Chu
VLDB
1992
ACM
151views Database» more  VLDB 1992»
15 years 8 months ago
Parallelism in a Main-Memory DBMS: The Performance of PRISMA/DB
This paper evaluates the performance of the parallel, main-memory DBMS, PRISMA/DB. First, an architecture for parallel query execution is presented. A performance model for the ex...
Annita N. Wilschut, Jan Flokstra, Peter M. G. Aper...
TNN
1998
114views more  TNN 1998»
15 years 4 months ago
Bayesian retrieval in associative memories with storage errors
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
Friedrich T. Sommer, Peter Dayan
IPPS
2007
IEEE
15 years 10 months ago
Optimizing the Fast Fourier Transform on a Multi-core Architecture
The rapid revolution in microprocessor chip architecture due to multicore technology is presenting unprecedented challenges to the application developers as well as system softwar...
Long Chen, Ziang Hu, Junmin Lin, Guang R. Gao
KR
2004
Springer
15 years 10 months ago
Breadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
Rong Zhou, Eric A. Hansen