A formulation for dynamical decision-making in an integrated manufacturing environment : C. Temponi, F.L. Lewis, J.D. Aplevich, J.J. Mills, pp 25–30
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 229 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0967-0661
No coin nor oath required. For personal study only.
✦ Synopsis
This paper develops a stat.echasts-based. specification for real-time job-s~edul~, g sy .s~ns, am .a .~... pares it to the modal primitive recumve arithmeuc of Yodaiken anu Ramamritham. 042 Enabling Efficient Schedulability Analysis throngh Progrm Transformations and Restricted Resource Contention* A.D. Stoyenko, TJ. Marlowe, W.A. Halang, pp 269-273 We present polynomial-time static semantics-preserving transformations of real-time programs..Used.in .mnjun..cti.ou with schedulabllity analysis, the transformauons si~nificandy, m_,cnmse the class of real-time programs that may De analyzea emclenuy Ior guaranteed schedulal0fiity at compile-time. In cases where the form of resource oententiou among processes resists efficient transformation, we apply a heuristic transformation (and a consequent run-time scheduling heuristic) to tUow the programs to be analyzed efficiently. 043 A Scheduling Strategy for a Distributed Hard Real-time Programming Environment J.M. Adin, M.F. Magalhies, pp 275-280
This paper discusses the integrated scheduling strategy adopted to try to meet the timing requinanents of distributed programs wrium 201 hi: ~ These prog .mn.s. indudc periodic modutes..wi~ precedence relations, apenodic modules and modules wzmout timing requirements (nou-real-timc modules). Modules can snare remote resources using servers. The scheduling strategy consists of three levels. To off-line search for a feasible schedule for