Assignment of ADT modules to processors

Welch, Lonnie R.

doi:10.1109/ipps.1992.223069

Cited by 18 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous work [SI has shown the need for an algorithm to assign ADT modules to processors, but development of such an algorithm was not the focus of the work. Scuh an algorithm is presented in [14].…”

Section: Helated Workmentioning

confidence: 99%

Assignment and pre-run-time scheduling of object-based, parallel real-time processes

Verhoosel

Hammer

Luit

et al.

Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing

Self Cite

View full text Add to dashboard Cite

The use of object-based programming techniques h.elps to reduce the cost of software development and maindenance, due to the benefits of reuse, information h.idin.g and encapsulation. This is especially helpful in complex, real-time systems that are highly parallel a,nd distributed, due to thear magnitude. The paper presents a semi-preemption execution. model of objectbased real-time systems th,at simplifies reasoning about th.e quality of particular-process-to-processor assignments. Th,e m,odel is used t o define system properties such. as in,ter-process parallelism, processor utilization and inter-processor communication. Additionally, we present an innovative assignment algorithm that incorporates feasibility constraints, and is guided b y an objective th.at balances minimum communication agnin.st maxim.um. parallelism. This work is part of a complete nssignin.ent an.d pre-run-tim.e scheduling approach for distributed real-time systems. IiitroductionDuring the last decade, dependability of computer systems has become ail increasingly important topic. In addition t,o correct functionality, dependability includes tim.eliness, i.e., real-time constraints imposed on t,he t,asks of the system must be satisfied. A condit,ion often required to guarantee timeliness is that applicat,ions and the environment have to be fully, or almost fully, predict>able. Otherwise, due to the overhead of scheduling a transient burst of new tasks at run-time, it might become impossible to satisfy the HRT constraints of cert,ain tasks. For instance, simu1a.tion results of an evduation of the run-time scheduling strategy described in [7] show that timeliness cannot be guaranteed in all circumstances. Given such a model, schedulability analysis techniques can be used t,o analyze an application [lo]. However, we prefer to schedule a, hard real-time system pre-run-time, such that. all t,iming constraint,s are satisfied and consistency of all resources, including processors, communication media and devices, is guaranteed [12]; with this approach, the run-time system simply dispatches and executes tasks according to the schedule constructed pre-run-time.We consider a distributed memory MIMD system that consists of a set of homogeneous processors P R , connected by a set of communication media CM. A communication medium is either a bus that connects a set of usually more than two processors or a link that connects two processors directly. The only assumption made about the interconnection configuration is that there is a set routes consisting of links, busses and processors between each pair of different processors. Each route is a sequence of triples sprj E PR, cmj E C M , rpri E PR, that indicates via which processors, busses and links, a communication from processor sprl to rprr has to be routed. Additionally, the system contains several shared memory modules and a set of physical devices DV, of different types such as sensor, actuator, and disk. Each device is assigned and physically connected to a particular processor after assignment of ...

show abstract

Section: Helated Workmentioning

confidence: 99%

Assignment and pre-run-time scheduling of object-based, parallel real-time processes

Verhoosel

Hammer

Luit

et al.

Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing

Self Cite

View full text Add to dashboard Cite

show abstract

“…Object-based real-time task model [9,11] An object-based real-time application can be designed as described below and summarized in Fig. 4:…”

Section: Figure 3: Paths In a Typical Emsmentioning

confidence: 99%

“…Techniques that try to exploit the parallelism inherent among the objects can help overcome these disadvantages. Two such techniques applied in this proposed architecture are i) cloning and ii) asynchronous remote procedure calls (ARPCs) [10,11,12]. Cloning: The technique of cloning is resolving contention among ADTs by replicating the software component on another processor so that more than one data item can be processed at a same time.…”

Section: Figure 3: Paths In a Typical Emsmentioning

confidence: 99%

“…This could lead to missed deadlines in task execution at real-time [4,9]. Task-scheduling algorithms [2,8,9,10,11,12] have been proposed in real-time system literature that overcome the above problems with respect to performance by effectively scheduling the operation of different software components. This work attempts to apply object-based real-time task scheduling in an EMS in a distributed multi-processor environment.…”

Section: Introductionmentioning

confidence: 99%

“…This work attempts to apply object-based real-time task scheduling in an EMS in a distributed multi-processor environment. Having the object-oriented model of the EMS applications in hand, a systematic analysis towards allocation and scheduling of each of the software components/methods to the different processors is performed based on well-established algorithms [8][9][10][11][12]. This paper provides a detailed treatment of the background material along with an illustration of the application of the above concepts with the aid of object-based model of a few sample EMS applications.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A hierarchical distributed object-oriented architecture for energy management system

Ramanathan

Gutiérrez-Alcaraz

IEEE PES Power Systems Conference and Exposition, 2004.

View full text Add to dashboard Cite

This paper presents a novel hierarchical distributed architecture for Energy Management Systems that is based on resource management in real-time systems. The foundation of this architecture is an object-oriented model of the entire power system. The overall framework for the architecture has been developed through the application of algorithms that exploit the inherent parallelism between objects in scheduling objectoriented tasks in real-time. In this research an attempt has been made to provide a new perspective for the problem of designing efficient information/communication architecture for Energy Management Systems by viewing it as one of efficient resource management in real-time systems. This paper presents the detailed description of the proposed framework, along with an illustration of the key aspects through an example power system application.

show abstract

Fault-Tolerant Dynamic Scheduling of Object-Based Real-Time Tasks in Multiprocessor Systems

Gupta

Manimaran

Murthy

2000

Dependable Network Computing

View full text Add to dashboard Cite

Assignment of ADT modules to processors

Cited by 18 publications

References 13 publications

Assignment and pre-run-time scheduling of object-based, parallel real-time processes

Assignment and pre-run-time scheduling of object-based, parallel real-time processes

A hierarchical distributed object-oriented architecture for energy management system

Fault-Tolerant Dynamic Scheduling of Object-Based Real-Time Tasks in Multiprocessor Systems

Contact Info

Product

Resources

About