Load Balancing White Papers
Load Balancing Parallel Explicit State Model Checking
Overview This paper first identifies some of the key concerns about the techniques and algorithms developed for parallel model checking; specifically, the inherent problem with load balancing and large queue sizes resultant in a static partition algorithm. This paper then presents a load balancing algorithm to improve the run time performance in distributed model checking, reduce maximum queue size, and reduce the number of states expanded before error discovery. The load balancing algorithm is based on Generalized Dimension Exchange (GDE). This paper presents an empirical analysis of the GDE based load balancing algorithm on three different supercomputing architectures - distributed memory clusters, Networks Of Workstations (NOW) and shared memory machines.
| Publisher | Brigham Young University | File Format | |
|---|---|---|---|
| Date Published | August 2004 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 5 out of 9 users found this white paper useful
White Paper RSS
Download
Register
