Over the past decade, the decreasing cost of minicomputer components has encouraged the use of multiprocessor techniques in the design of high-speed, cost-effective computer systems. Multiprocessor architectures have two principal advantages over conventional single-processor designs. First, a multiprocessor system can achieve greater computational speed through parallelism in its task structur...

Liu and Layland discovered the famous utilization bound N(2 1 N − 1) for fixed-priority scheduling on singleprocessor systems in the 1970’s. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and...

Real-time multiprocessor systems are now commonplace. Designs range from single-chip architectures, with a modest number of processors, to large-scale signal-processing systems, such as synthetic-aperture radar systems. For uniprocessor systems, the problem of ensuring that deadline constraints are met has been widely studied: effective scheduling algorithms that take into account the many comp...

Multiprocessor systems are the wave of the future rightly said because they offer tremendous potential to solve inherently parallel and complex computation intensive applications. In order to exploit the full potential of such computing systems, job scheduling or processor allocation (both are considered synonyms here) decisions plays a great role. Such scheduling decisions involves determining...

Scheduling parallel tasks on multiprocessor systems is to allocate a set of tasks to processors such that the optimal usage of processors and accepted computation time for scheduling algorithm are obtained. In multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for achieving a high performance. The need for ...

Most current multiprocessor le systems are designed to use multiple disks in parallel, using the high aggregate bandwidth to meet the growing I/O requirements of parallel scienti c applications. Most multiprocessor le systems provide applications with a conventional Unix-like interface, allowing the application to access those multiple disks transparently. This interface conceals the parallelis...

Title of Dissertation: COMMUNICATION-DRIVEN CODESIGN FOR MULTIPROCESSOR SYSTEMS Neal Kumar Bambha, Doctor of Philosophy, 2004 Dissertation directed by: Professor Shuvra S. Bhattacharyya Department of Electrical and Computer Engineering Several trends in technology have important implications for embedded systems of the future. One trend is the increasing density and number of transistors that c...

We present a tool-assisted platform-based design ow for embedded multiprocessor applications. The methodology relies on (1) a formal language which provides constructs to specify the platformindependent behavior of an application using an abstract execution model, and to describe the micro-architecture components of the hardware architecture, together with its compilation chain JAHUEL [1], and...

All practical real-time scheduling algorithms in multiprocessor systems present a trade-off between their computational complexity and performance. In real-time systems, tasks have to be performed correctly and timely. Finding minimal schedule in multiprocessor systems with real-time constraints is shown to be NP-hard. Although some optimal algorithms have been employed in uni-processor systems...