5005 search results - page 95 / 1001 » The Design and Analysis of Parallel Algorithms |
102
click to vote
CCGRID
2003
IEEE
15 years 6 months ago
2003
IEEE
— Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are eit...
123
click to vote
ISCAPDCS
2003
15 years 2 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
102
click to vote
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns....
PVM
2004
Springer
15 years 6 months ago
2004
Springer
We introduce a refinement strategy to bring the parallel performance analysis closer to the user. The analysis starts with a simple high-level performance model. It is based on fir...
128
Voted
COR
2011
14 years 7 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...