Minimizing cost and minimizing schedule length in synthesis of fault tolerant multiprocessors systems

Authors:
Mieczyslaw Drabowski;Krzysztof Czajkowski
Affiliations:
Cracow University of Technology, Krakow, Poland;Cracow University of Technology, Krakow, Poland
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 5
Cited 1

Scheduling Multiprocessor Tasks to Minimize Schedule Length

IEEE Transactions on Computers
Embedded hardware and software self-testing methodologies for processor cores

Proceedings of the 37th Annual Design Automation Conference
Hardware-software cosynthesis of multi-mode multi-task embedded systems with real-time constraints

Proceedings of the tenth international symposium on Hardware/software codesign
An Industrial Environment for High-Level Fault-Tolerant Structures Insertion and Validation

VTS '02 Proceedings of the 20th IEEE VLSI Test Symposium
Reliability-Aware Co-Synthesis for Embedded Systems

ASAP '04 Proceedings of the Application-Specific Systems, Architectures and Processors, 15th IEEE International Conference

The ant colony in par-synthesis of computer system

ASC '07 Proceedings of The Eleventh IASTED International Conference on Artificial Intelligence and Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper includes a proposal of a new approach of synthesis of fault tolerant multiprocessors systems. Optimal task scheduling and optimal partition at resources are basic problems in high-level synthesis of computer systems. Coherent synthesis may have a practical application in developing tools for computers aided design of such systems.