Sciweavers

7103 search results - page 980 / 1421
» Program Generation and Components
Sort
View
PPOPP
1999
ACM
15 years 9 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
IEEEPACT
1999
IEEE
15 years 9 months ago
Cameron: High level Language Compilation for Reconfigurable Systems
This paper presents the Cameron Project 1 , which aims to provide a high level, algorithmic language and optimizing compiler for the development of image processing applications o...
Jeffrey Hammes, Robert Rinker, A. P. Wim Böhm...
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
15 years 9 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
128
Voted
COMPSAC
1998
IEEE
15 years 9 months ago
M-base: Enduser-Initiative Application Development Based on Message Flow and Componentware
Explosive increase in enduser computing on distributed systems requires that endusers develop application software by themselves. One solution is given as a formula of "a dom...
Takeshi Chusho, Mitsuyoshi Matsumoto, Yuji Konishi
ICPP
1998
IEEE
15 years 9 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang