6897 search results - page 474 / 1380 » Parallelization of Modular Algorithms |
153
Voted
SASP
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this paper, we present Parade, a novel and flexible parallel architecture for the deinterleaving of combined pulsetrains. This is a commonly performed task in various areas ...
122
click to vote
EUROPAR
2009
Springer
15 years 11 months ago
2009
Springer
The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse line...
134
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
The research interest in sensor nets is still growing because they simplify data acquisition in many applications. If hardware resources are very sparse, routing algorithms cannot...
105
click to vote
FPGA
2003
ACM
15 years 10 months ago
2003
ACM
Placement and routing are the most time-consuming processes in automatically synthesizing and configuring circuits for field-programmable gate arrays (FPGAs). In this paper, we ...
142
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper presents a hierarchical parallel MPEG-2 decoder for playing ultra-high-resolution videos on PC cluster based tiled display systems. To maximize parallelism while minimi...