1 / 13

Embedded Parallel Systems Based on Dynamic Look-Ahead Reconfiguration in Redundant Systems

Embedded Parallel Systems Based on Dynamic Look-Ahead Reconfiguration in Redundant Systems. Stephen Holmes. Introduction. Laskowski and Tudruj

kimberly-weaver
Télécharger la présentation

Embedded Parallel Systems Based on Dynamic Look-Ahead Reconfiguration in Redundant Systems

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. Embedded Parallel Systems Based on Dynamic Look-Ahead Reconfiguration in Redundant Systems Stephen Holmes

  2. Introduction • Laskowski and Tudruj • Seeks to improve execution time for a multi-processor configuration with a Dynamic Look-Ahead System for the reconfiguration of inter-processor connections

  3. Look-Ahead Dynamic Connection Reconfiguration • Used to predict the optimal configuration of a system • Changes with the program • Changes instituted with crossbar switches • Changes controlled with a control processor (CP)

  4. Branching Task Graph • Developed for this system • Used to optimize look-ahead systems • Weighted version of a directed acyclic graph

  5. Additional Forms of BTG • The extended Assigned Program Graph (XAPG) gives a specified schedule for a program • The Extended Communication Activation Graph (XCAG)

  6. Program Partitions • The program is first put into a list schedule minimizing the number of communications and execution time • Second the optimum set of switches is found for the execution of each section.

  7. Conditional Branch Scheduling • Detection of Mutually-Exclusive paths to use the same resources, and assigned the same time slot • Uses the most used branches for scheduling

  8. Optimization • The optimal configuration of processor connections is found for each of the sections • The lowest number of switches that can be used to implement all of the different configurations is found

  9. Results • Compared to a modified Earliest task first (ETF) system • Measure • tR: reconfiguration time of a single connection • tV: section activation time overhead • a: average time between connection reconfigurations • R= a/(tR+tV): reconfiguration control efficiency

  10. Results • Most significant speedup for systems with low reconfiguration efficiency • Tested on a Strassen matrix multiplication algorithim

  11. Critique • Pros • Optimizes use of multiple processors • Minimizes the reconfiguration time • Cons • Adaptability • Hardware

  12. Questions?

  13. References • E. Laskowski, M. Tudruj Embedded Parallel Systems Based on Dynamic Look-Ahead Reconfiguration in Redundant Communication Resources, Proceedings of the 9th EUROMICRO Conference on Digital System Design, 2006, pp. 176-179

More Related