Sciweavers

192 search results - page 1 / 39
» Ultrafast Algorithm for Designing Focused Combinational Arra...
Sort
View
JCISD
2000
51views more  JCISD 2000»
13 years 6 months ago
Ultrafast Algorithm for Designing Focused Combinational Arrays
Dimitris K. Agrafiotis, Victor S. Lobanov
FPGA
1999
ACM
139views FPGA» more  FPGA 1999»
13 years 10 months ago
Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...
Yaska Sankar, Jonathan Rose
DAC
2005
ACM
14 years 7 months ago
Memory access optimization through combined code scheduling, memory allocation, and array binding in embedded system design
In many of embedded systems, particularly for those with high data computations, the delay of memory access is one of the major bottlenecks in the system's performance. It ha...
Jungeun Kim, Taewhan Kim
SIGMOD
2011
ACM
442views Database» more  SIGMOD 2011»
12 years 9 months ago
ArrayStore: a storage manager for complex parallel array processing
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...
Emad Soroush, Magdalena Balazinska, Daniel L. Wang
ICCS
2005
Springer
13 years 11 months ago
Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
Ion I. Mandoiu, Claudia Prajescu, Dragos Trinca