SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:uu-492221"
 

Search: onr:"swepub:oai:DiVA.org:uu-492221" > Scheduling Parallel...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Scheduling Parallel Real-Time Tasks on Virtual Processors

Jiang, Xu (author)
Northeastern Univ, Key Lab Intelligent Comp Med Image, Minist Educ, Shenyang 110819, Liaoning, Peoples R China.
Liang, Haochun (author)
Northeastern Univ, Key Lab Intelligent Comp Med Image, Minist Educ, Shenyang 110819, Liaoning, Peoples R China.
Guan, Nan (author)
City Univ Hong Kong, Hong Kong, Peoples R China.
show more...
Tang, Yue (author)
Northeastern Univ, Key Lab Intelligent Comp Med Image, Minist Educ, Shenyang 110819, Liaoning, Peoples R China.
Qiao, Lei (author)
Beijing Inst Control Engn, Beijing 100124, Peoples R China.
Wang, Yi (author)
Uppsala universitet,Datorteknik,Northeastern Univ, Key Lab Intelligent Comp Med Image, Minist Educ, Shenyang 110819, Liaoning, Peoples R China.
show less...
Northeastern Univ, Key Lab Intelligent Comp Med Image, Minist Educ, Shenyang 110819, Liaoning, Peoples R China City Univ Hong Kong, Hong Kong, Peoples R China. (creator_code:org_t)
IEEE, 2023
2023
English.
In: IEEE Transactions on Parallel and Distributed Systems. - : IEEE. - 1045-9219 .- 1558-2183. ; 34:1, s. 33-47
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • In many popular parallel programming models, e.g., OpenMP (OpenMP, 2013), applications are usually dispatched into several dedicated scheduling entities (named "threads " in common) for which the processor time of physical platform is provided through the OS schedulers. This behavior requires for a hierarchical scheduling framework, considering each thread as a virtual processor (VP). Moreover, hierarchical scheduling allow separate applications to execute together on a common hardware platform, with each application having the "illusion " of executing on a dedicated component. However, the problem for scheduling parallel real-time tasks on virtual multiprocessor platform has not been addressed yet. An analogous approach to virtual scheduling for parallel real-time tasks is federeted scheudling, where each task exclusively executes on a set of dedicated physical processors. However, federated scheduling suffers significant resource wasting. In this article, we study the scheduling of real-time parallel task on virtual multiprocessors. As a physical processor is shared by virtual processors, tasks effectively share processors with each other. We conduct comprehensive performance evaluation to compare our proposed approach with existing methods of different types. Experiment results show that our approach consistently outperforms existing methods to a considerable extent under a wide range of parameter settings.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Datorsystem (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Computer Systems (hsv//eng)
NATURVETENSKAP  -- Data- och informationsvetenskap -- Datorteknik (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Engineering (hsv//eng)

Keyword

Real-time scheduling
vitual processors
parallel tasks
multiprocessor

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Jiang, Xu
Liang, Haochun
Guan, Nan
Tang, Yue
Qiao, Lei
Wang, Yi
About the subject
ENGINEERING AND TECHNOLOGY
ENGINEERING AND ...
and Electrical Engin ...
and Computer Systems
NATURAL SCIENCES
NATURAL SCIENCES
and Computer and Inf ...
and Computer Enginee ...
Articles in the publication
IEEE Transaction ...
By the university
Uppsala University

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view