Process scheduling for performance estimation and synthesis of hardware/software systems

Eles, Petru; Kuchcinski, Krzysztof; Peng, Zebo; Doboli, Alex; Pop, Paul

doi:10.1109/eurmic.1998.711792

Cited by 6 publications

(11 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The average deviation for all graphs is 4.73% with UB, 4.69% with CP, and 2.35%, two times smaller, with PCP. Further details concerning the PCP policy and its experimental evaluation can be found in [33].…”

Section: Priority Assignmentmentioning

confidence: 99%

See 1 more Smart Citation

Scheduling with bus access optimization for distributed embedded systems

Eles

Doboli

Pop

et al. 2000

IEEE Trans. VLSI Syst.

Self Cite

105

View full text Add to dashboard Cite

Abstract-In this paper, we concentrate on aspects related to the synthesis of distributed embedded systems consisting of programmable processors and application-specific hardware components. The approach is based on an abstract graph representation that captures, at process level, both dataflow and the flow of control. Our goal is to derive a worst case delay by which the system completes execution, such that this delay is as small as possible; to generate a logically and temporally deterministic schedule; and to optimize parameters of the communication protocol such that this delay is guaranteed. We have further investigated the impact of particular communication infrastructures and protocols on the overall performance and, specially, how the requirements of such an infrastructure have to be considered for process and communication scheduling. Not only do particularities of the underlying architecture have to be considered during scheduling but also the parameters of the communication protocol should be adapted to fit the particular embedded application. The optimization algorithm, which implies both process scheduling and optimization of the parameters related to the communication protocol, generates an efficient bus access scheme as well as the schedule tables for activation of processes and communications.

show abstract

Section: Priority Assignmentmentioning

confidence: 99%

“…Several approaches are based on list scheduling heuristics using different priority criteria [29]- [32] or on branch-and-bound algorithms [33], [34]. In [35] and [36], static scheduling and partitioning of processes, and allocation of system components, are formulated as a mixed integer linear programming (MILP) problem.…”

mentioning

confidence: 99%

Scheduling with bus access optimization for distributed embedded systems

Eles

Doboli

Pop

et al. 2000

IEEE Trans. VLSI Syst.

Self Cite

105

View full text Add to dashboard Cite

show abstract

“…The time needed for scheduling of the individual paths depends on the employed algorithm. As demonstrated in [5], good quality results can be obtained with a list scheduling based algorithm which needs less than 0.003 seconds for graphs having 120 nodes.…”

Section: Experimental Evaluationmentioning

confidence: 98%

“…We present algorithms for scheduling of the individual paths in [5]. In this paper we concentrate on the generation mechanism of the global schedule table.…”

Section: The Scheduling Strategymentioning

confidence: 99%

“…The main problem which has to be solved is to find the new activation time for P i so that conflicts are avoided. In [5] we demonstrated the following two theorems in the context of our table generation algorithm: Theorem 1 Consider a process P i which is part of two paths, L k and L q , with activation times τ Pi Lk and τ Pi Lq respectively. If the set of predecessors of P i is different in the two paths, then no conflict is possible between the columns corresponding to the two activation times.…”

Section: Conflict Handling At Table Generationmentioning

confidence: 99%

See 1 more Smart Citation