Optimization models for recovery block schemes

Article Abstract:

Research was conducted to examine optimization models for a fault tolerant software through a set of versions for a given program. Two recovery block schemes, namely, consensus recovery block and independent recovery block, were considered. Results provide proof that the optimal arrangement of versions in a recovery block scheme is provided by the list of versions ordered from lowest to highest depending on failure probabilities.

Models, Mathematical optimization, Optimization theory, Fault tolerant computer systems, Fault tolerance (Computers)

---

Scheduling of resource tasks

Article Abstract:

A deterministic task scheduling model where each task needs some fixed amounts of resources out of a given set of resources during execution was examined. The goal was to look for a feasible schedule meeting for a given optimization requirement. The SIT-graph algorithm, an exact method that permits solving interesting and important classes of scheduling problems in polynomial time, was employed.

Operations Research, Scheduling (Management)

---

Similar abstracts:

• Abstracts: Rate-monotonic scheduling for hard-real-time systems. Task scheduling with and without communication delays: a unified approach
• Abstracts: Teaming up for a chemical experiment. Structuring investments
• Abstracts: A failed state that is succeeding in parts. Not yet reborn
• Abstracts: Evaluating naval tactical missile systems by fuzzy AHP based on the grade value of membership function. Evaluating attack helicopters by AHP based on linguistic variable weight
• Abstracts: Relationships between businesses and marketing research firms: impact of partnering on performance. Reengineering using the theory of constraints: a case analysis of Moore business forms

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.