Massively Parallel Processing of Image Contours

Visual Form ◽  
1992 ◽  
pp. 137-154
Author(s):  
Ling Tony Chen ◽  
Larry S. Davis ◽  
Clyde P. Kruskal
Keyword(s):  
Parallel Processing ◽  
Massively Parallel ◽  
Massively Parallel Processing

A STRATEGY FOR SCHEDULING PARTIALLY ORDERED PROGRAM GRAPHS ONTO MULTICOMPUTERS

1995 ◽  
Vol 05 (04) ◽  
pp. 575-586
Author(s):  
BEN LEE ◽  
ALI R. HURSON
Keyword(s):  
Parallel Processing ◽  
Message Passing ◽  
Massively Parallel ◽  
Communication Overhead ◽  
Simulation Studies ◽  
Global Approach ◽  
Partially Ordered ◽  
Massively Parallel Processing ◽  
Time Scheduling ◽  
Scheduling Heuristic

The issue of scalability is key to the success of massively parallel processing. Due to their distributed nature, message-passing multicomputers are appropriate for achieving scalar performance. However, the message-passing model lacks programmability due to difficulties encountered by the programmers to partition and schedule the computation over the processors and to establish efficient inter-processor communication in the user code. Therefore, this paper presents a compile-time scheduling heuristic, called BLS, that maps programs onto the processors of a message-passing multicomputer. In contrast to other methods proposed, BLS takes a more global approach in attempt to balance the tradeoff between exploiting parallelism and reducing communication overhead. To evaluate the effectiveness of BLS, simulation studies of scheduling SISAL programs are presented.

A 3-D stacked chip packaging solution for miniaturized massively parallel processing

1999 ◽  
Vol 22 (3) ◽  
pp. 424-432 ◽  
Author(s):  
R.M. Lea ◽  
I.P. Jalowiecki ◽  
D.K. Boughton ◽  
J.S. Yamaguchi ◽  
A.A. Pepe ◽  
...  
Keyword(s):  
Parallel Processing ◽  
Massively Parallel ◽  
Massively Parallel Processing
Sign in / Sign up

Export Citation Format

Share Document