A fault-tolerant software algorithm for a network of transputers
Benage, William Fred, Jr.
Kodres, Uno R.
MetadataShow full item record
This thesis presents a software algorithm that resends work packages to processors when one or more of the worker processors fails or when the link with one or more processors fails. There are two resend criteria used in this algorithm: "resend at end of initial assignment" and "resend at time out". The work, divided into several packages in order to run on several processors in parallel, will be completed as long as at least one work processor remains working and communicating with the main processor. This algorithm could add some fault-tolerance to computer processing in embedded systems.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
A periodic scheduling heuristic for mapping iterative task graphs onto distributed memory multiprocessors Kasinger, Charles D. (Monterey, California. Naval Postgraduate School, 1994-09);This thesis investigates the problem of statically assigning the tasks of applications represented by repetitive task graphs (such as sonar or radar signal processing) to the processors of a distributed memory multiprocessor ...
Usefulness of compile-time restructuring of large grain data flow programs in throughput-critical applications Cross, David M. (Monterey, California. Naval Postgraduate School, 1993-09);In this thesis, Large Grain Data Flow (LGDF) representation of parallelism is applied to throughout-critical applications that process periodically arriving data. The applications are represented by directed acyclic graphs ...
Gaver, Donald Paul; Jacobs, Patricia A.; Becker, Kevin J.; Lawphongpanich, Siriphong (Monterey, California. Naval Postgraduate School, 1996-09); NPS-OR-96-010This paper addresses the problem in which jobs of different types arrive at a system that consists of a collection of individual and somewhat diverse processors. The processors differ in that each may spedalize in one job ...