1536 search results - page 216 / 308 » DPS - Dynamic Parallel Schedules |
139
click to vote
ICN
2005
Springer
15 years 9 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
154
click to vote
RTCSA
2003
IEEE
15 years 9 months ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
146
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
Parallel architectures are the way of the future, but are notoriously difficult to program. In addition to the low-level constructs they often present (e.g., locks, DMA, and non-...
133
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
—Using the well-known ATLAS and LAPACK dense linear algebra libraries, we demonstrate that the parallel management overhead (PMO) can grow with problem size on even statically sc...
134
click to vote
CCGRID
2001
IEEE
15 years 7 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...