Sciweavers

2609 search results - page 137 / 522
» Optimizing for parallelism and data locality
Sort
View
PDCAT
2005
Springer
15 years 6 months ago
Performance Comparison between VOPP and MPI
View-Oriented Parallel Programming is based on Distributed Shared Memory which is friendly and easy for programmers to use. It requires the programmer to divide shared data into v...
Zhiyi Huang, Martin K. Purvis, Paul Werstein
101
Voted
EUROPAR
2009
Springer
15 years 4 months ago
A Buffer Space Optimal Solution for Re-establishing the Packet Order in a MPSoC Network Processor
We consider a multi-processor system-on-chip destined for streaming applications. An application is composed of one input and one output queue and in-between, several levels of ide...
Daniela Genius, Alix Munier Kordon, Khouloud Zine ...
CVPR
2010
IEEE
15 years 9 months ago
Parallel and Distributed Graph Cuts by Dual Decomposition
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
Petter Strandmark, Fredrik Kahl
88
Voted
KDD
1994
ACM
82views Data Mining» more  KDD 1994»
15 years 4 months ago
Architectural Support for Data Mining
Oneof the mainobstacles in applying data mining techniques to large, real-world databasesis the lack of efficient data management.In this paper, wepresent the design and implement...
Marcel Holsheimer, Martin L. Kersten
103
Voted
SPAA
2003
ACM
15 years 6 months ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd