2681 search results - page 137 / 537 » Performance results of running parallel applications on the ... |
161
click to vote
JACM
2000
15 years 6 months ago
2000
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
151
click to vote
SC
2004
ACM
15 years 12 months ago
2004
ACM
Programmers of message-passing codes for clusters of workstations face a daunting challenge in understanding the performance bottlenecks of their applications. This is largely due...
167
click to vote
CCGRID
2001
IEEE
15 years 10 months ago
2001
IEEE
Global Computing achieves high throughput computing by harvesting a very large number of unused computing resources connected to the Internet. This parallel computing model target...
162
click to vote
MVA
1994
15 years 7 months ago
1994
In our work we improve the EPPI programming environment, which was made in the University of Castilla - la Mancha one year ago. EPPI is a tool for simulating parallel algorithms t...
171
click to vote
CONCURRENCY
2004
2004
User transparency: a fully sequential programming model for efficient data parallel image processing
15 years 6 months ago
Although many image processing applications are ideally suited for parallel implementation, most researchers in imaging do not benefit from high performance computing on a daily b...