Loading...
Please wait, while we are loading the content...
Similar Documents
Dynamic Load Balancing of Parallel Cellular Automata (2000)
| Content Provider | CiteSeerX |
|---|---|
| Author | Hersch, Roger D. Gennart, Benoit A. Mazzariol, Marc |
| Abstract | We are interested in running in parallel cellular automata. We present an algorithm which explores the dynamic remapping of cells in order to balance the load between the processing nodes. The parallel application runs on a cluster of PCs connected by Fast-Ethernet. A general cellular automaton can be described as a set of cells where each cell is a state machine. To compute the next cell state, each cell needs some information from neighbouring cells. There are no limitations on the kind of information exchanged nor on the computation itself. Only the automaton topology defining the neighbours of each cell remains unchanged during the automaton's life. As a typical example of a cellular automaton we consider the image skeletonization problem. Skeletonization requires spatial filtering to be repetitively applied to the image. Each step erodes a thin part of the original image. After the last step, only the image skeleton remains. Skeletonization algorithms require vast amounts of com... |
| File Format | |
| Publisher Date | 2000-01-01 |
| Access Restriction | Open |
| Subject Keyword | Cellular Automaton State Machine Thin Part Image Skeleton Spatial Filtering Dynamic Remapping Processing Node Parallel Application Image Skeletonization Problem General Cellular Automaton Typical Example Require Vast Amount Next Cell State Parallel Cellular Automaton Automaton Topology Last Step Original Image Dynamic Load Balancing |
| Content Type | Text |
