Distributed computers are often the most cost-effective means of meeting the performance requirements of an embedded computing application. Embedded distributed computing is a particularly challenging design problem because the hardware and software architectures must be simultaneously optimized. We have presented a suit of new co-synthesis algorithms for heterogeneous distributed systems of arbitrary topology. Our algorithms make use of tight yet easy-to-compute bounds on the schedulability of tasks to guide its heuristic search.
KeywordsEmbed System Arbitrary Topology Tributed System Preemptive Priority Embed System Designer
Unable to display preview. Download preview PDF.