### Table 3: Parallel Shortest Path Algorithm

1997

"... In PAGE 4: ... Our parallel shortest path algorithm uses the SPMD model for which each processor solves the portion of the shortest path tree on its subnetwork for each source. The outline of the algorithm is given in Table3 . Each processor repeatedly solves for shortest paths for its assigned subnetwork.... ..."

Cited by 7

### Table 3: Parallel Shortest Path Algorithm

1997

"... In PAGE 4: ... Our parallel shortest path algorithm uses the SPMD model for which each processor solves the portion of the shortest path tree on its subnetwork for each source. The outline of the algorithm is given in Table3 . Each processor repeatedly solves for shortest paths for its assigned subnetwork.... ..."

Cited by 7

### Table 2: Properties of the MPEG-4 decoding tasks that determine the mapping onto HW or SW.

2002

"... In PAGE 8: ....1. Processing characteristics To come to a partitioning of the functionality in HW and SW, we separate the MPEG-4 decoder functions into tasks with self-contained functionality and clear interfaces. Table2 shows an overview of these tasks, including their processing characteristics. As explained in Section 2.... In PAGE 10: ... VLD context calculation 16 157 16 16 shape decoder 16 16 down samp up samp reference BAB memory CAD current bab mem Inverse scan AC/DC prediction MB stripe memory iQuant iDCT VOP reconstr up samp padding demux 16 27 49 362 run-length decode reference VOP memory 500 313 94 VLD Variable Length Decoder BAB Binary Alpha Block CAD Context-based Arithmetic Decoder SW implementation HW implementation memory 353 357 362 362 313 70 Figure 5: Block diagram of Video Object Plane decoder, including data transport bandwidths (MByte/s). The bottom row in Table2 represents the rendering and composition of all objects into the final scene. The first part of this functionality comprises a BIFS browser, analog to a VRML browser.... ..."

Cited by 5

### Table 16: Summary of the existing parallel algorithms

"... In PAGE 23: ...be found in the Table16 and the detail descriptions of each algorithm can be found in the reference [Cho93]. However, the challenge in designing parallel algorithms for solving the optimization problem is limited by the common approach, i.... ..."

### Table 15: Test case 3: results of 4-process parallel algorithm

2000

"... In PAGE 39: ... The number of big steps is reduced to 4. The test results on both machines is shown in Table15 . In the parallel approach with 6 processors, the 2000 examples are divided into 6 subsets.... ..."

Cited by 6

### Table 3: Overview over algorithms and their parallelization and application.

"... In PAGE 4: ... The majority of the processing modules in our processing approach are computationally demanding and require some form of parallelization for optimal usability. Table3 below lists the different modules and give some overview over the parallelization strategies used. 4.... ..."

### Table 11: Test case 2: results of 4-process parallel algorithm

2000

"... In PAGE 37: ...Table11 . The concepts induced by di erent processors in one big step are shown in the table.... ..."

Cited by 6

### Table 16: Test case 3: results of 6-process parallel algorithm

2000

Cited by 6

### Table 7: Test case 1: results of 4-process parallel algorithm

2000

"... In PAGE 34: ...Table7 . The concepts induced by di erent processors in one big step are shown in the table.... ..."

Cited by 6

### Table 8: Test case 1: results of 6-process parallel algorithm

2000

Cited by 6