A Research on Dynamic Scheduling Strategy for Aperiodic Tasks in Multiprocessor

Jun Ding; Na Li

doi:10.4028/www.scientific.net/AMR.811.587

Paper Titles

Using the Nearest Neighbor Algorithm to Build a Web-Based Recommender System for House Trading and Matching
p.564

The Design of Temperature and Humidity Control System of Fresh-Keeping Storage Based on Fuzzy PID Inference Algorithm
p.569

A New Ray Casting Algorithm Based on an Adjustable Threshold and Error Controlling
p.575

Research on Rapid Interactive Top-Level Design Support Environment for Complex System of Systems
p.581

A Research on Dynamic Scheduling Strategy for Aperiodic Tasks in Multiprocessor
p.587

Supporting Development Processes: UBCS as a Software Tool for Hardware Selection
p.592

Dual Coordinator Structure for Zigbee Network
p.598

Context-Aware Framework for the Support of User Services
p.602

Trusted Operating Systems for Manufacturing E-Commerce System Secure
p.608

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 811A Research on Dynamic Scheduling Strategy for...

A Research on Dynamic Scheduling Strategy for Aperiodic Tasks in Multiprocessor

Abstract:

This paper in-depth analyses the existing multiprocessor dynamic scheduling algorithms for aperiodic task, andproposes a moderately grouping algorithmbased on grouping and selecting appropriate strategy for the multiprocessor system.Satisfyingthe task deadline ofthe smaller objective function value, grouping strategy give priority to the taskshared access to the resources, improving the utilization rate of resources. Based on the earliest available time between therequired task and theprocessor in system, selecting appropriate strategy will schedule the task to the processor, improvingthe processor utilization.Compared with the existing algorithms, moderately grouping algorithm has a better performance.

You might also be interested in these eBooks

Modern Materials and Technologies of Industrial Production

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 811)

Pages:

587-591

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.811.587

Citation:

Cite this paper

Online since:

September 2013

Authors:

Jun Ding, Na Li

Keywords:

Aperiodic, Dynamic Scheduling, Real-Time

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Ramamritham K. Scheduling algorithms and operating systems support for Real-Time Systems. Proceeding of IEEE, 82(1): 55~67, (1994).

DOI: 10.1109/5.259426

Google Scholar

[2] Goossens J, Funk S, Baruah S. Priority-driven scheduling of Periodic task systems on multiProeessors. Real-time systems, 2003, 25(2~3): 187~205, (2003).

DOI: 10.1023/a:1025120124771

Google Scholar

[3] Andersson B, Baruah S, Jonsson J. Static-Priority seheduling on multiProeessors. IEEE real-time systems systems symposium, London, UK, (2001).

DOI: 10.1109/real.2001.990610

Google Scholar

[4] Zhao W, Ramamritham, K, Stankovic J A. Seheduling tasks with resource requirements in hard real-time systems. IEEE transactions on software engineering, 13(5): 564-577, (1987).

DOI: 10.1109/tse.1987.233201

Google Scholar

[5] Ramritham K, Stankovic J A. Efficient seheduling algorithms for real-time multiProcessorsystems. IEEEtransactions on Parallel and distributed systems, 1(2): 184~194, (1989).

Google Scholar

[6] Norbert Struck. Realtime operating systems in automotive. ATZelektronik worldwide, Volume 2, Issue 1, p.23~25, 2007-03-01.

DOI: 10.1007/bf03242112

Google Scholar

[7] Le TrungKhoa, Hoang Trang. Design an Optimized CPU Architecture for Pacemaker Applications. 4th International Conference on Biomedical Engineering in Vietnam, p.50~53, (2013).

DOI: 10.1007/978-3-642-32183-2_14

Google Scholar