Proceedings Article10.1109/NPC.2007.26
Allocating Tasks in Multi-core Processor based Parallel System
Yi Liu,Xin Zhang,He Li,Depei Qian +3 more
- 18 Sep 2007
- pp 748-753
56
TL;DR: Evaluation result shows that the algorithm can find near-optimal solutions in reasonable time, and behaves better than genetic algorithm when the number of threads increases, since it can find solutions in much less time than Genetic algorithm.
read more
Abstract: After a discussion of the task allocation problem in multi-core processor based parallel system, this paper gives the task allocation model, and proposes an iteration-based heuristic algorithm, which is composed of two rounds of operations, in which the processes are assigned to processing nodes in the first round and threads in process are assigned to processor cores in the second round respectively. Each round of operation partitions the task interaction graph by iterations with backtracking. Evaluation result shows that the algorithm can find near-optimal solutions in reasonable time, and behaves better than genetic algorithm when the number of threads increases, since it can find solutions in much less time than genetic algorithm.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Review of Hardware Platforms for Real-Time Simulation of Electric Machines
Sameer Mojlish,Nuh Erdogan,David Levine,Ali Davoudi +3 more
- 23 Jan 2017
TL;DR: The machine models considered are the lumped parameter models, including the phase-domain, voltage-behind-reactance models, and physics-based models, as well as the finite-element method and magnetic equivalent circuit models.
64
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies
Thomas Sauerwald,He Sun +1 more
- 20 Oct 2012
TL;DR: This work investigates several randomized protocols for different communication models in the discrete case of discrete load balancing and demonstrates that there is almost no difference between the discrete and continuous case.
55
Partitioning real-time systems on multiprocessors with shared resources
Farhang Nemati,Thomas Nolte,Moris Behnam +2 more
- 14 Dec 2010
TL;DR: A blocking-aware partitioning algorithm which allocates a task set on a multiprocessor (multi-core) platform in a way that the overall amount of blocking times of tasks are decreased and this algorithm reduces the total utilization.
54
Mapping Algorithms for Multiprocessor Tasks on Multi-Core Clusters
Jörg Dümmler,Thomas Rauber,Gudula Rünger +2 more
- 09 Sep 2008
TL;DR: This paper considers different mapping algorithms for M-tasks and investigates the resulting efficiency and scalability, and presents experimental results for different application programs and different multi-core systems.
27
A Walkthrough of Name Data Networking: Architecture, Functionalities, Operations and Open issues
Vishwa Pratap Singh,R. L. Ujjwal +1 more
TL;DR: A detailed survey on NDN architecture, protocols, and previously proposed strategies is presented and a comparative study on proposed strategies for naming, content caching, inter and intradomain routing, forwarding, and security is offered.
22
References
NP-complete scheduling problems
TL;DR: It is shown that the problem of finding an optimal schedule for a set of jobs is NP-complete even in the following two restricted cases, tantamount to showing that the scheduling problems mentioned are intractable.
1.5K
Task partitioning for multi-core network processors
Robert Ennals,Richard Sharp,Alan Mycroft +2 more
- 04 Apr 2005
TL;DR: A new approach in which a high-level program is separated from its partitioning into concurrent tasks, and an AMS script that partitions it into a form capable of running at 3Gb/s on an Intel IXP2400 Network Processor is presented.
On multiprocessor task scheduling using efficient state space search approaches
Yu-Kwong Kwok,Ishfaq Ahmad +1 more
TL;DR: Based on an extensive experimental evaluation of the algorithms, it is concluded that the parallel algorithm with pruning techniques is an efficient scheme for generating optimal solutions of reasonably large problems while the approximate algorithm is effective if slightly degraded solutions are acceptable.
62
An improved two-step algorithm for task and data parallel scheduling in distributed memory machines
Savina Bansal,Padam Kumar,Kuldip Singh +2 more
- 01 Nov 2006
TL;DR: A two-step Modified Critical Path and Area-based (MCPA) scheduling heuristic is developed which targets at improving the processor allocation phase of an existing Critical Path-based scheduling algorithm and turns out to be much better than the parent CPA algorithm and comparable to the high complexity Critical Path reduction algorithm.
49
Infinite parallel job allocation (extended abstract)
Petra Berenbrink,Artur Czumaj,Tom Friedetzky,Nikita Vvedenskaya +3 more
- 09 Jul 2000
TL;DR: A new sequential process is introduced and it is shown that the sequential process models the behavior of the parallel one very accurately and the obtained solution of the differential equations and the results presented above are applicable to the parallel process, too.
17
Related Papers (5)
Sanjoy Baruah,Nathan Fisher +1 more
- 05 Dec 2005
James H. Anderson,Umamaheswari C. Devi +1 more
- 01 Jan 2006