Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 计算机科学技术学报 , 2002, Abstract: In this paper we propose a novel scheme for scheduling divisible task on parallel processors connected by system interconnection network with arbitrary topology. The divisible task is a computation that can be divided into arbitrary independent subtasks solved in parallel. Our model takes into consideration communication initial time and communication delays between processors. Moreover, by constructing the corresponding Network Spanning Tree (NST) for a network, our scheme can be applied to all kinds of network topologies. We present the concept of Balanced Task Distribution Tree and use it to design the Equation Set Creation Algorithm in which the set of linear equations is created by traversing the NST in post-order. After solving the created equations, we get the optimal task assignment scheme. Experiments confirm the applicability of our scheme in real-life situations.
 International Journal of Advanced Computer Research , 2012, Abstract: Multi-core processor technology has been enhancedspectacularly and it is reasonably good inperformance than single core processors therebyhaving the potential to enable computationintensivereal-time applications with precise timingconstraints. Mostly traditional multiprocessor real -time scheduling is stick to Sequential models whichignore intra-task parallelism while Parallel modelssuch as OpenMP have the capability to parallelizespecific segments of tasks, thereby leading to shorterresponse times when possible. In this paper variousresearch papers have been reviewed and arecategorized as Sequential Real-Time Task basedResearch and Parallel Real-Time Task basedResearch. Also various approaches such as tasksplitting techniques, scheduling policies andtechniques used are considered for comparing realtime task scheduling in multi-core processors.
 International Journal of Innovative Technology and Exploring Engineering , 2012, Abstract: Multiprocessor mapping and scheduling algorithms have been extensively studied over the past few decades and havebeen tackled from different perspectives.Task scheduling is an essential aspect of parallel programming. Most heuristics for this NP-hard problem are based on asimple system model that assumes fully connected processors and concurrent interprocessor communication. Hence, contention for communication resources is not considered in task scheduling, yet it has a strong influence on the execution time of a parallel program. This paper investigates the incorporation of contention awareness into task scheduling. The proposed methodology is runtime scheduling which is designed to reduce the wastage of time during static scheduling. We have assumed heterogeneous processors with broadcast and point-to-point communication models and have presented online algorithms for them. Experimental results shows that dynamic scheduling provides better performance than static scheduling.
 International Journal of Computer Science & Information Technology , 2011, Abstract: In this paper we propose a model of distributed multi-core processors with software controlled dynamicvoltage scaling. We consider the problem of energy efficient task scheduling with a given deadline on thismodel. We consider send-receive task graphs in which the initial task sends data to multiple intermediatetasks, and the final task collects the data from these intermediate tasks with the restriction that the initialand final tasks should be assigned on the same core.
 Computer Science , 2013, Abstract: While previous work on energy-efficient algorithms focused on assumption that tasks can be assigned to any processor, we initially study the problem of task scheduling on restricted parallel processors. The objective is to minimize the overall energy consumption while speed scaling (SS) method is used to reduce energy consumption under the execution time constraint (Makespan $C_{max}$). In this work, we discuss the speed setting in the continuous model that processors can run at arbitrary speed in $[s_{min},s_{max}]$. The energy-efficient scheduling problem, involving task assignment and speed scaling, is inherently complicated as it is proved to be NP-Complete. We formulate the problem as an Integer Programming (IP) problem. Specifically, we devise a polynomial time optimal scheduling algorithm for the case tasks have a uniform size. Our algorithm runs in $O(mn^3logn)$ time, where $m$ is the number of processors and $n$ is the number of tasks. We then present a polynomial time algorithm that achieves an approximation factor of $2^{\alpha-1}(2-\frac{1}{m^{\alpha}})$ ($\alpha$ is the power parameter) when the tasks have arbitrary size work. Experimental results demonstrate that our algorithm could provide an efficient scheduling for the problem of task scheduling on restricted parallel processors.
 软件学报 , 1999, Abstract: Optimum degree of parallelism-based task dependence graph scheduling scheme fully utilizes the global information collected at compile-time, employs the techniques such as task merging in horizontal and vertical directions, processors pre-allocation, combination of static and dynamic scheduling, and integration of centralized scheduling and layer-scheduling. It is a simple, practical and effective scheduling method which addresses the problem of how to both reduce the execution time of programs and economize on processor resources.
 计算机应用研究 , 2010, Abstract: With different task allocation and scheduling will lead to different time consumption and energy consumption on heterogeneous multi-core processors,using approprivate task matching and scheduling algorithms can save more energy. Now,it is widely recognized that the most promising of the task allocation and scheduling is first to use heuristic way to match the tasks, and then to use of genetic algorithm to shedule.This paper first made improvements in task matching, then used genetic algorithm to resolve the energy for the first time.The results show that it can use less time to reduce more energy consumption in less real time circumstances.
 计算机科学 , 2011, Abstract: For periodic hard real-time tasks running on homogeneous multi core processors, an energy-efficient approach based on dynamic voltage scaling (DVS) was designed. First, computation tasks are ordered by decreasing cycles and task mapping is arranged based on the principle of the shortest scheduling length for computation tasks. Then the computation task with the minimum commun- ication time is set as the last executed computation task while the order of other computation tasks keep unchanged for each processor core. The optimal execution order of computation tasks on each processor core is determined during execution time extension in the case of all computation tasks arranged with the highest frequency in the initial mapping. Experiments were conducted on several random task sets based on the power model of the Intel PXA270. Results show that the proposed approach can decrease energy of multi-core processors eff ectively.
 计算机应用研究 , 2012, Abstract: The effect of task scheduling is one of the important factors which decide the performance of the parallel distributed computer system. In order to optimize the task scheduling, this paper proposed a novel algorithm based on some typical algorithms e. g. LG, PPA algorithm etc. . On the one hand, the algorithm replicated precursor tasks which meet the duplication conditions in order to shorten the scheduling length. On the other hand, the algorithm replicated other precursor tasks and merged redundant clusters to reduce the number of the required processors. Simulation results show that the proposed algorithm's performance on scheduling length and the number of the required processors is better than the above typical algorithms'. Furthermore, the proposed algorithm has a smaller time complexity and benefits the performance of the parallel distributed computer system.
 Jagbeer Singh Computer Science , 2011, Abstract: In Real-time system, utilization based schedulability test is a common approach to determine whether or not tasks can be admitted without violating deadline requirements. The exact problem has previously been proven intractable even upon single processors; sufficient conditions are presented here for determining whether a given periodic task system will meet all deadlines if scheduled non-preemptively upon a multiprocessor platform using the earliest-deadline first scheduling algorithm. Many real-time scheduling algorithms have been developed recently to reduce affinity in the portable devices that use processors. Extensive power aware scheduling techniques have been published for energy reduction, but most of them have been focused solely on reducing the processor affinity. The non-preemptive scheduling of periodic task systems upon processing platforms comprised of several same processors is considered.
 Page 1 /100 Display every page 5 10 20 Item