A framework for specification and design of software for advanced sensor systems

Muntz, A.H.; Horowitz, Ellis

doi:10.1109/real.1989.63571

Cited by 8 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By contrast Ada provides a single mechanism, priority, which can be used to influence task scheduling. Thus in the most general case, a hierarchical resource management scheme is needed to determine task priority based on the characteristics of individual activities [6]. It is possible, however, that special cases might exist in which a resource management hierarchy might be unnecessary.…”

Section: Extensions To Adamentioning

confidence: 99%

Design Specifications for Adaptive Real-Time Systems

Lichota¹

1991

View full text Add to dashboard Cite

show abstract

Section: Extensions To Adamentioning

confidence: 99%

Design Specifications for Adaptive Real-Time Systems

Lichota¹

1991

View full text Add to dashboard Cite

show abstract

“…The language, called RTM, may be used to program a real-time system as well as its simulation model and is used to develop the initial model, its subsequent refinements and the operational system. RTM supports interrupts and task/message priorities, and may be used to program sporadic, periodic, and adaptive [MH89] tasks. An RTM program may be executed in an appropriate environment to evaluate its satisfaction of timing constraints under various workload.…”

Section: Introductionmentioning

confidence: 99%

IEEE Workshop on Real-Time Operating Systems (8th) Held in Atlanta, Georgia on 15-17 May 1991

Ramamritham¹

1992

View full text Add to dashboard Cite

Id.rmran fWireal-time system: the spinlock. Spinlocks are low-level Low-level multiprocessor synchronization primitives, synchronization mechanisms for multiprocessor systems such as spinlocks. are usually designed with little or that are used to provide mutual exclusion. They are no consideration about timing constraints, which makes usually implemented with the help of atomic instruct',em inappropriate foe r.,al-time systems. In this paper, tions like test-.andset that most multiprocessors prowe propose a new synchronization mechanism, the pri-vide. HIowever, spinlock implementations are usually oriLy spinlock, that takes into account the priorities of proposed with little or no consideration of timing conthe processes that want to-acquire it, and favors high straints. So, current implementations service requests for priority processes. We define what a priority spinlock is, the lock randomly or at best FIFO. Random service of and propose two algorithms to implement-priority spin-requests, are inappropriate for real-time systems; FIFO locks with local spinning. -Priority spinlocks can-be Used service is appropriate in real-time applications, because to provide prioritized mutually exclusive-access to shared it bounds the worst case time where a processor has to resources in real-time multiprocessor systems. They can wait to acquire the spinlock. lowever, FIFO implemenalso be used as building blocks for higher level priority tations may force a high priority process that wants to synchronization primitives, such as priority semal hores, acquire a spinlock to wait for all the low priority processes that happen to have requested the spinlock before it. This potentially long wait leads to very conservative 1 Introduction scheduling, because although the worst case priority inversion is bounded. the bound is very large. Re-.l-time systems have timing constraints that mustIn this paper we propose a new version of spinlocks -be met, otherwise catastrophic effects may happen [13]. called priority spinlocks. Priority spinlocks take into acTiming constraints usually take the form of deadlines, count the priority of the process that wants to acquire earliest starting times, or value functions. Schedulers the lock, and assign the locks to the highest priority protranslate these timing constraints along with recourse re-cess that has requested the lock at the time the decision quirements and criticalities into priorities (2, 3, 5. 7. 12], is being made. and assign the resources of the system to higher -priority processes. These priorities must be preserved -through--out the system, otherwise the correctness of a real-tine 1.1 Priority spinlocks system can not be demonstrated. If there is-a server Priority spinlocks ate defined as follows: where priorities are not preserved, then a high priority process may be delayed (possibly indefinitely) by a 1. No more than one processor may possess a lock at j low priority process. This event is called priority inone time.version, and must be avoided, bounded, or minimized, otherwise ...

show abstract

Application of MIDAS Approach to the Design of Real-Time Systems

Shen

Bagrodia

1991

IFAC Proceedings Volumes

View full text Add to dashboard Cite

A framework for specification and design of software for advanced sensor systems

Cited by 8 publications

References 11 publications

Design Specifications for Adaptive Real-Time Systems

Design Specifications for Adaptive Real-Time Systems

IEEE Workshop on Real-Time Operating Systems (8th) Held in Atlanta, Georgia on 15-17 May 1991

Application of MIDAS Approach to the Design of Real-Time Systems

Contact Info

Product

Resources

About