1 / 26

Parallel LTL Model Checking

Parallel LTL Model Checking. CS 586. The Capacity Problem. Capacity = memory states*stateSize. Increase capacity by - Increasing memory - Decreasing states - Decreasing state size. Double DFS in Parallel. Memory available in one machine.

asis
Download Presentation

Parallel LTL Model Checking

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Parallel LTL Model Checking CS 586

  2. The Capacity Problem Capacity = memory states*stateSize Increase capacity by - Increasing memory - Decreasing states - Decreasing state size

  3. Double DFS in Parallel Memory available in one machine Memory needed to store visited states

  4. DDFS Search order B A C If the dfs2 from A visits C first, then the dfs2 from B will not visit C and will not detect a cycle. Solutions?

  5. Use a different algorithm. Schedule the dfs2 searches Use different bits to mark dfs2 visits ______ ? Solution Ideas

  6. Forget about proving correctness. Each search process is random. Coordinate efforts to find cycles. Coordination scheme should be.. Decentralized Fault-tolerant Better than no coordination at all One Idea

  7. Forager Allocation Problem • Given: • several foraging sites with varying quality • the current needs of the hive • a pool of foragers • Allocate the foragers to: • maximize the collection of needed resources • Without central control.

  8. Scouts locate patches

  9. Scouts multicast their findings Scout performs a waggle dance which is observed by unemployed foragers. Duration and intensity of the dance describe the quality of the patch.

  10. Workers visit patches. A worker will observe a dance and leave for a patch. Returns, unloads and dances. May visit patch again.

  11. Apis Mellifera Bee forager Search flight pattern Flower patch Pollen Waggle dance BEE (bee-based error explorer) Search agent Random walk Accept state Property Violation Multicast Adaptation

  12. Decentralized Cooperative Search B A C Launch n random searches. When one finds an accept state, advertize its location. Listen to and possibly ignore advertizements.

  13. BEE Search BEE BEE controller BEE BEE distribute problem

  14. BEE Search controller multicast an accept state

  15. BEE Search controller more multicasts report an error

  16. BEE Search controller search continues…

  17. BEE Search controller search terminated

  18. Experimental Environment • Classroom laboratory workstations • Lowest priority level • 8 MB of RAM per machine • Compare with isolated parallel random walks to measure advantage of coordination.

  19. Speedup-SS7

  20. Speedup-11peterson

  21. Too Much Communication 11 Peterson SS 7

  22. Negative Feedback WATER COLLECTING ACCEPT STATE FORAGING water in hive evaporative cooling time to receive cycle advertisement water seeking by receiver bees recruit to cycle foraging abandon accept state foraging time to find an unloader recruiting to water collecting (waggle dance) abandoning of water collecting

  23. Negative Feedback

More Related