Liew, Daniel Leong Wan2024-08-142024-08-1419891989https://hdl.handle.net/1828/18716Software designed to function in a hard real-time environment requires strict timing and precedence constraints. Software that is logically correct, i.e., implements the intended algorithm, may not function correctly if certain assumptions about timing characteristics are not met at run-time. A distributed hard real-time system provides reliability, availability and fault tolerance. However, the software for such systems is more complex in that it must also take into consideration resource contention as well as the associated communication delays. This thesis presents a methodology for automating the development of distributed hard real-time systems. Heuristic algorithms for realizing the proposed methodology are introduced and implemented. Our strategy differs from previous work in that we also include provisions for deadline scheduling of messages, instead of assuming an unlimited communication bandwidth. We pre-allocate processor time slots for tasks as well as communication time slots for messages. Actual examples of applying the implemented algorithm to pre-allocate tasks in a distributed environment such that timing constraints are met are presented and com­pared with previous work in this field. Areas for further research are also suggested.125 pagesAvailable to the World Wide WebThesis