A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
Multiprocessor Scheduling For Tasks With Priority Using GA
[article]
2010
arXiv
pre-print
In multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for achieving a high performance. ...
In multiprocessor scheduling problem, a given program is to be scheduled in a given multiprocessor system such that the programs execution time is minimized. ...
In multiprocessor real time systems static algorithms are used to schedule periodic tasks whose characteristics are known a priori. ...
arXiv:1001.1985v1
fatcat:lcdfa3e7sfhj5crn3dyh4dnyue
Mode Change Protocol for Multi-Mode Real-Time Systems upon Identical Multiprocessors
[article]
2008
arXiv
pre-print
In this paper, we propose a synchronous protocol without periodicity for scheduling multi-mode real-time systems upon identical multiprocessor platforms. ...
Our proposal can be considered to be a multiprocessor extension of the uniprocessor protocol called "Minimal Single Offset protocol". ...
Commonly, real-time systems are modeled by a fixed set of such tasks. ...
arXiv:0809.5238v1
fatcat:vsemnzwun5cdbjizfsccfv35nu
Implications of classical scheduling results for real-time systems
1995
Computer
Important classical scheduling theory results for real-time computing are identi ed. Implications of these results from the perspective of a real-time systems designer are discussed. ...
Uni-processor and multiprocessor results are addressed as well as important issues such a s future release times, precedence constraints, shared resources, task value, overloads, static versus dynamic ...
Multi-processor Real-Time Scheduling More and more real-time systems are relying on multiprocessors. ...
doi:10.1109/2.386982
fatcat:pgdsgkk5mbhzra4bud4w5fxerq
Energy-efficient embedded software implementation on multiprocessor system-on-chip with multiple voltages
2006
ACM Transactions on Embedded Computing Systems
This paper develops energy-driven completion ratio guaranteed scheduling techniques for the implementation of embedded software on multiprocessor systems with multiple supply voltages. ...
We leverage application's performance requirements, uncertainties in execution time, and tolerance for reasonable execution failures to scale each processor's supply voltage at run-time to reduce the multiprocessor ...
The most relevant works on DVS, to this paper, are on the energy minimization of dependent tasks on multiprocessor systems with multiple voltages. ...
doi:10.1145/1151074.1151078
fatcat:7l6bqwuhdndibhxs2joaykrcum
Energy-Aware Task Partitioning on Heterogeneous Multiprocessor Platforms
[article]
2012
arXiv
pre-print
This paper addresses the problem of energy-aware static partitioning of periodic real-time tasks on heterogeneous multiprocessor platforms. ...
A Particle Swarm Optimization variant based on Min-min technique for task partitioning is proposed. ...
To handle real-time tasks on multiprocessor system, task utilization is considered instead of execution time and completion utilization is used. ...
arXiv:1206.0396v1
fatcat:ngwwizk7gnfprjq266zlycwegy
Power Efficient Scheduling Scheme based on PSO for Real Time Systems
2015
International Journal of Computer Applications
It addresses the problem of energy-aware static partitioning of periodic real time tasks on heterogeneous multiprocessor platforms. ...
Power efficient design of real-time embedded systems based on multi-processors becomes more important as system functionality is increasingly realized through heuristic approaches. ...
To handle real-time tasks on multiprocessor system, task utilization is considered instead of execution time and completion utilization is used. ...
doi:10.5120/19526-1157
fatcat:ht6m3m4a3vertiuyzoaoktv24e
Real-Time Scheduling in Heterogeneous Systems Considering Cache Reload Time Using Genetic Algorithms
[chapter]
2009
IFIP Advances in Information and Communication Technology
Here, we propose a suboptimal static scheduler of nonpreemptable tasks in hard real-time heterogeneous multiprocessor systems considering time constraints and cache reload time. ...
The approach makes use of genetic algorithm to minimize total completion time and number of processors used, simultaneously. ...
Equation (1) defines minimizing completion time of tasks because minimization of finish time of each task (t i F ) means that the completion time of the set of tasks is minimized, and (2) expresses minimizing ...
doi:10.1007/978-3-642-04284-3_11
fatcat:ygmlub36yvgpffsfu5stzsce3e
A Performance Study of GA and LSH in Multiprocessor Job Scheduling
[article]
2010
arXiv
pre-print
Multiprocessors have emerged as a powerful computing means for running real-time applications, especially where a uni-processor system would not be sufficient enough to execute all the tasks. ...
In multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for achieving a high performance. ...
In multiprocessor real time systems static algorithms are used to schedule periodic tasks whose characteristics are known a priori. ...
arXiv:1002.1149v1
fatcat:ck7vtmg5bnhernbbrlx6xwqgk4
Hybrid Scheduling Scheme for Real Time Systems
2016
INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY
This paper addresses the problem of energy-aware static partitioning of periodic real time tasks on heterogeneous multiprocessor platforms. ...
Systems as asymmetric multiprocessor platforms are considered power-efficient multiprocessor architectures, efficient task partitioning (assignment) and play a crucial role in achieving more energy efficiency ...
To handle real-time tasks on multiprocessor system, task utilization is considered instead of execution time and completion utilization is used. ...
doi:10.24297/ijct.v15i6.1584
fatcat:v6zdc5bdjzb5vccu73a4vrj6wm
Hard real-time multiobjective scheduling in heterogeneous systems using genetic algorithms
2009
2009 14th International CSI Computer Conference
One of them is cache reload time in multiprocessor systems. These problems exist in real-time systems, too. ...
In addition, it tries to propose a generalized method for real-time multiobjective scheduling in multiprocessor systems using genetic algorithms. ...
Equation (1) defines minimizing completion time of tasks because minimization of finish time of each task (t i F ) means that the completion time of the set of tasks is minimized, and (2) expresses minimizing ...
doi:10.1109/csicc.2009.5349619
fatcat:bymqivfssreo5cf4pj3mwmtpfm
A Comparative Study on Dynamic Scheduling of Real-Time Tasks in Multiprocessor System using Genetic Algorithms
2015
International Journal of Computer Applications
Multiprocessors have evolved as powerful computing tools for executing dynamic real time tasks. ...
task in multiprocessor systems. ...
Dhingra, S. et al [8] proposed a genetic algorithm for multiprocessor system and were able to minimize the make span and total completion time. ...
doi:10.5120/21340-4346
fatcat:xpdnvuy2jrakrdxemsedsxdaqm
Tardiness Reduction Technique for Multiprocessor Scheduling based on New Assignment Strategy
English
2015
International Journal of Computer Trends and Technology
English
In the real-time system, scheduling is an important factor which decides a schedule for a set of tasks. ...
These parameters are well known to as for optimal scheduling algorithm in real-time system. ...
EDF (Earliest Deadline First) has been proved to be optimal scheduling algorithm for single processor real-time system. It also performs well for multiprocessor system. ...
doi:10.14445/22312803/ijctt-v25p107
fatcat:gxzl7anwv5g4rgee4co6w5gnqe
Assigning real-time tasks to heterogeneous processors by applying ant colony optimization
2011
Journal of Parallel and Distributed Computing
A local search heuristic that can be used by various metaheuristics to improve the assignment solution is proposed and its time and space complexity is analyzed. ...
The problem of determining whether a set of periodic tasks can be assigned to a set of heterogeneous processors without deadline violations has been shown, in general, to be NP-hard. ...
In many real-time systems, the set of real-time tasks may change dynamically. ...
doi:10.1016/j.jpdc.2010.09.011
fatcat:nx7fnyzvgrcu3kqji4nyl3lvry
Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms
[article]
2008
arXiv
pre-print
In this paper, we address the power-aware scheduling of sporadic constrained-deadline hard real-time tasks using dynamic voltage scaling upon multiprocessor platforms. ...
Our first algorithm is an off-line speed determination mechanism which provides an identical speed for each processor. ...
For real-time systems, this DVS framework focuses on minimizing the energy consumption while respecting all the timing constraints. ...
arXiv:0712.2958v2
fatcat:cizc4p76vnchteqx6feoo2o4we
Ec-A: A Task Allocation Algorithm For Energy Minimization In Multiprocessor Systems
2014
Zenodo
This paper presents a novel task dependent job allocation algorithm: Energy centric- Allocation (Ec-A) and Rate Monotonic (RM) scheduling to minimize energy consumption in a multiprocessor system. ...
With the necessity of increased processing capacity with less energy consumption; power aware multiprocessor system has gained more attention in the recent future. ...
These algorithms are used to guarantee quality of service in computing systems and the first quantum based optimal global scheduling algorithm for multiprocessor real time systems was proposed: Proportionate ...
doi:10.5281/zenodo.1091689
fatcat:62vtfm2be5cnrcsxuvmjwachqy
« Previous
Showing results 1 — 15 out of 12,787 results