A COMPARISON OF SIX BATCH-MODE ALGORITHMS FOR MAPPING INDEPENDENT TASKS TO HETEROGENEOUS GRIDS

Author(s):  
Amal Khalifa ◽  
Reda Ammar ◽  
Tahany Fegrany ◽  
Mohammed Fahmy Tolba
Keyword(s):  
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey

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.


2010 ◽  
Vol 9 (1) ◽  
pp. 107-112 ◽  
Author(s):  
Igor Cretescu ◽  
Mariana Diaconu ◽  
Cornel Cojocaru ◽  
Roxana Elena Benchea ◽  
Cornel Pohontu
Keyword(s):  

1995 ◽  
Vol 31 (9) ◽  
pp. 101-107 ◽  
Author(s):  
Chongchin Polprasert ◽  
Charles N. Haas

Anaerobic reactors were operated in a semi-batch mode and fed with the dual substrates glucose (G) plus acetic acid (Ac) as primary organic sources to study the effect of sulfate on COD oxidation. With glucose, COD removal by methane formation was seriously inhibited, resulting in COD accumulation in the reactor. Although acetic acid can be consumed by some sulfate-reducing species, it was not a major substrate for sulfate reduction, but was largely responsible for methane formation in the anaerobic mixed culture used in this study. With dual substrates, extreme inhibition of methanogenesis did not occur as did with glucose alone. Instead, methanogens were found to work in harmony with acid formers as well as sulfate reducers to oxidise COD. Interestingly, from 12-hour monitoring, increased G/Ac COD ratios decreased COD removal rates as well as biogas production, but resulted in higher sulfate reduction. This suggests that there should be an optimal feed G/Ac COD ratio, for which removal of both organics could be maximised.


1994 ◽  
Vol 30 (11) ◽  
pp. 143-146
Author(s):  
Ronald D. Neufeld ◽  
Christopher A. Badali ◽  
Dennis Powers ◽  
Christopher Carson

A two step operation is proposed for the biodegradation of low concentrations (< 10 mg/L) of BETX substances in an up flow submerged biotower configuration. Step 1 involves growth of a lush biofilm using benzoic acid in a batch mode. Step 2 involves a longer term biological transformation of BETX. Kinetics of biotransformations are modeled using first order assumptions, with rate constants being a function of benzoic acid dosages used in Step 1. A calibrated computer model is developed and presented to predict the degree of transformation and biomass level throughout the tower under a variety of inlet and design operational conditions.


1994 ◽  
Vol 29 (7) ◽  
pp. 327-333
Author(s):  
Y. Matsui ◽  
F. Yamaguchi ◽  
Y. Suwa ◽  
Y. Urushigawa

Activated sludges were acclimated to p-nitrophenol (PNP) in two operational modes, a batch and a continuous. The operational mode of the PNP acclimation of activated sludges strongly affected the physiological characteristics of predominant microorganisms responsible for PNP degradation. Predominant PNP degraders in the sludge in batch mode (Sludge B) had lower PNP affinity and were relatively insensitive to PNP concentration. Those of the sludge in continuous mode (Sludge C), on the other hand, had very high PNP affinity and were sensitive to PNP. MPN enumeration of PNP degraders in sludge B and C using media with different PNP concentrations (0.05, 0.2,0.5 and 2.0 mM) supported the above results. Medium with 0.2 mM of PNP did not recover PNP degraders in sludge C well, while it recovered PNP degraders in sludge B as well as the medium with 0.05 mM did. When switching from one operational mode to the other, the predominant population in sludge B shifted to the sensitive group, but that of sludge C did not shift at the given loading of PNP, showing relative resistance to inhibitive concentration.


2012 ◽  
Vol 208 (1) ◽  
pp. 383-416 ◽  
Author(s):  
Raphael Fonteneau ◽  
Susan A. Murphy ◽  
Louis Wehenkel ◽  
Damien Ernst

2021 ◽  
Author(s):  
Panagiotis Bouros ◽  
Nikos Mamoulis ◽  
Dimitrios Tsitsigkos ◽  
Manolis Terrovitis

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.


Sign in / Sign up

Export Citation Format

Share Document