Graph partition based mapping algorithm on multiprocessors for streaming applications
To take advantage of multiprocessor platform,it is a necessity to map tasks of the application properly onto different processors to exploit the concurrency in the application and thus meet the stringent timing requirements.Parallelism graph was proposed to quantify and model the concurrency among t...
Saved in:
Main Authors: | Qi TANG, Shang-feng WU, Jun-wu SHI, Ji-bo WEI |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2016-06-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016123/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Optimal memory time Cache partitioning in chip-multiprocessors
by: Hao LI, et al.
Published: (2012-04-01) -
Homomorphisms of complete n-partite graphs
by: Robert D. Girse
Published: (1986-01-01) -
Summary of Large-Scale Grapb Partitioning Algoritbms
by: Jinfeng Xu, et al.
Published: (2014-07-01) -
LGP-SA:Graph partition algorithm based on simulated annealing in large-scale graph processing
by: Jinfeng XU, et al.
Published: (2016-02-01) -
Optimizing multiprocessor performance in real-time systems using an innovative genetic algorithm approach
by: Heba E. Hassan, et al.
Published: (2025-01-01)