Algorithms for hierarchical and semi-partitioned parallel scheduling
نویسندگان
چکیده
منابع مشابه
Semi-partitioned Mixed-Criticality Scheduling
Scheduling isolation in mixed-criticality systems is challenging without sacrificing performance. In response, we propose a scheduling approach that combines server-based semi-partitioning and deadline scaling. Semipartitioning (whereby only some tasks migrate, in a carefully managed manner), hitherto used in single criticality systems, offers good performance with low overheads. Deadline-scali...
متن کاملParallel Algorithms for Hierarchical
Hierarchical clustering is a common method used to determine clusters of similar data points in multidimensional spaces. O(n 2) algorithms are known for this problem 3, 4, 10, 18]. This paper reviews important results for sequential algorithms and describes previous work on parallel algorithms for hierarchical clustering. Parallel algorithms to perform hierarchical clustering using several dist...
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کاملEnergy efficient semi-partitioned scheduling for embedded multiprocessor streaming systems
In this paper, we study the problem of energyminimization whenmapping streaming applications with throughput constraints to homogeneous multiprocessor systems in which voltage and frequency scaling is supported with a discrete set of operating voltage/frequency modes. We propose a soft real-time semi-partitioned scheduling algorithm which allows an even distribution of the utilization of tasks ...
متن کاملSemi-Partitioned Scheduling for Resource-Sharing Hard-Real-Time Tasks
As real-time embedded systems integrate more and more functionality, they are demanding increasing amounts of computational power that can only be met by deploying them on powerful multi-core architectures. Efficient task allocation and scheduling on such architectures is paramount. Multicore scheduling algorithms for independent real-time tasks has been the focus of much research over the year...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2021
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2021.03.006