scholarly journals Scheduling Independent Tasks with Voltage Overscaling

2015 ◽  
Author(s):  
Aurelien Cavelan ◽  
Yves Robert ◽  
Hongyang Sun ◽  
Frederic Vivien
Keyword(s):  
Voltage Overscaling ◽  
Independent Tasks

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

scholarly journals In-Memory Interval Joins

2021 ◽  
Author(s):  
Panagiotis Bouros ◽  
Nikos Mamoulis ◽  
Dimitrios Tsitsigkos ◽  
Manolis Terrovitis
Keyword(s):  
Parallel Computation ◽  
State Of The Art ◽  
Complex Data ◽  
Plane Sweep ◽  
Join Algorithm ◽  
Sweep Algorithm ◽  
Join Algorithms ◽  
Domain Partitioning ◽  
Complex Data Structure ◽  
Independent Tasks

AbstractThe interval join is a popular operation in temporal, spatial, and uncertain databases. The majority of interval join algorithms assume that input data reside on disk and so, their focus is to minimize the I/O accesses. Recently, an in-memory approach based on plane sweep (PS) for modern hardware was proposed which greatly outperforms previous work. However, this approach relies on a complex data structure and its parallelization has not been adequately studied. In this article, we investigate in-memory interval joins in two directions. First, we explore the applicability of a largely ignored forward scan (FS)-based plane sweep algorithm, for single-threaded join evaluation. We propose four optimizations for FS that greatly reduce its cost, making it competitive or even faster than the state-of-the-art. Second, we study in depth the parallel computation of interval joins. We design a non-partitioning-based approach that determines independent tasks of the join algorithm to run in parallel. Then, we address the drawbacks of the previously proposed hash-based partitioning and suggest a domain-based partitioning approach that does not produce duplicate results. Within our approach, we propose a novel breakdown of the partition-joins into mini-joins to be scheduled in the available CPU threads and propose an adaptive domain partitioning, aiming at load balancing. We also investigate how the partitioning phase can benefit from modern parallel hardware. Our thorough experimental analysis demonstrates the advantage of our novel partitioning-based approach for parallel computation.

scholarly journals InterRC: An Inter-Resources Collaboration Heuristic for Scheduling Independent Tasks on Heterogeneous Distributed Environments

MENDEL ◽  
2019 ◽  
Vol 25 (1) ◽  
pp. 179-188
Author(s):  
Abdelhamid Khiat ◽  
Abdelkamel Tari
Keyword(s):  
Task Scheduling ◽  
Initial Solution ◽  
Distributed Environments ◽  
Scheduling Problem ◽  
Reasonable Time ◽  
Independent Task ◽  
Np Hard Problem ◽  
Computing Environments ◽  
Scheduling Heuristic ◽  
Independent Tasks

The independent task scheduling problem in distributed computing environments with makespan optimization as an objective is an NP-Hard problem. Consequently, an important number of approaches looking to approximate the optimal makespan in reasonable time have been proposed in the literature. In this paper, a new independent task scheduling heuristic called InterRC is presented. The proposed InterRC solution is an evolutionary approach, which starts with an initial solution, then executes a set of iterations, for the purpose of improving the initial solution and close the optimal makespan as soon as possible. Experiments show that InterRC obtains a better makespan compared to the other efficient algorithms.

scholarly journals Solving Mathematics Olympiad Problems Training for Primary School Teachers in Bulukumba District

2020 ◽  
Vol 1 (1) ◽  
pp. 50-54
Author(s):  
Said Fachry Assagaf ◽  
Suradi Tahmir ◽  
Muhammad Dinar
Keyword(s):  
Elementary School ◽  
Teacher Training ◽  
Primary School ◽  
School Teacher ◽  
Primary Teachers ◽  
School Level ◽  
School Teachers ◽  
Primary School Teachers ◽  
Mathematics Class ◽  
Independent Tasks

This is elementary school teacher training to solve mathematics olympiad problems in Bulukumba district. The purpose of this training is to (1) provide information about mathematics olympiad in Indonesia (2) training teacher to solve mathematics olympiad problems, and (3) motivate  primary teachers to conduct olympiad class in their school.  The method is divided into two, namely the presentation and the independent tasks. The presentation focuses on the types of math competitions and the types of Olympic problems. Independent task aims to create and solve mathematics Olympiad problems for elementary school level. In addition, motivation was also being concerned in this training. The teachers were expected to use the problems in their mathematics class and also to identify students who potentially have ability join in mathematics competition. Abstrak Pengabdian ini berupa pelatihan olimpiade matematika tingkat Sekolah Dasar yang diperuntukkan bagi Guru Sekolah Dasar di Kabupaten Bulukumba. Tujuan pengabdian ini adalah untuk (1) memberikan pengetahuan terkait pelaksanaan olimpiade matematika di Indonesia (2) memberikan pemahaman terkait soal-soal olimpiade matematika, dan (3) memberikan motivasi kepada guru untuk melakukan pembimbingan olimpiade. Metode pelaksanaan terbagi atas dua yakni metode ceramah dan metode kerja mandiri. Metode ceramah berfokus kepada materi tentang jenis jenis kompetisi matematika dan jenis jenis soal olimpiade. Kerja mandiri bertujuan untuk membuat dan menyelesaikan soal olimpiade matematika tingkat SD. Selain itu, motivasi juga diberikan agar guru dapat mengadopsi soal tersbeut dalam kegiatan pembelajaran serta mencari bibit unggul yang dapat diikutkan untuk berkompetisi.

scholarly journals Multi-Objective Binary PSO with Kernel P System on GPU

2018 ◽  
Vol 13 (3) ◽  
pp. 323-336 ◽  
Author(s):  
Naeimeh Elkhani ◽  
Ravie Chandren Muniyandi ◽  
Gexiang Zhang
Keyword(s):  
Feature Selection ◽  
Computational Cost ◽  
Feature Selection Method ◽  
Binary Particle Swarm Optimization ◽  
P System ◽  
Time Cost ◽  
Multi Objective ◽  
Almost All ◽  
Binary Pso ◽  
Independent Tasks

Computational cost is a big challenge for almost all intelligent algorithms which are run on CPU. In this regard, our proposed kernel P system multi-objective binary particle swarm optimization feature selection and classification method should perform with an efficient time that we aimed to settle via using potentials of membrane computing in parallel processing and nondeterminism. Moreover, GPUs perform better with latency-tolerant, highly parallel and independent tasks. In this study, to meet all the potentials of a membrane-inspired model particularly parallelism and to improve the time cost, feature selection method implemented on GPU. The time cost of the proposed method on CPU, GPU and Multicore indicates a significant improvement via implementing method on GPU.

Sign in / Sign up

Export Citation Format

Share Document