scholarly journals Managing Energy Plus Performance in Data Centers and Battery-Based Devices Using an Online Non-Clairvoyant Speed-Bounded Multiprocessor Scheduling

2020 ◽  
Vol 10 (7) ◽  
pp. 2459 ◽  
Author(s):  
Pawan Singh ◽  
Baseem Khan ◽  
Om Prakash Mahela ◽  
Hassan Haes Alhelou ◽  
Ghassan Hayek
Keyword(s):  
Energy Management ◽  
Completion Time ◽  
Processing Time ◽  
Data Centers ◽  
Function Analysis ◽  
Multiprocessor Scheduling ◽  
Flow Time ◽  
Service Cost ◽  
Energy Plus ◽  
Time Required

An efficient scheduling reduces the time required to process the jobs, and energy management decreases the service cost as well as increases the lifetime of a battery. A balanced trade-off between the energy consumed and processing time gives an ideal objective for scheduling jobs in data centers and battery based devices. An online multiprocessor scheduling multiprocessor with bounded speed (MBS) is proposed in this paper. The objective of MBS is to minimize the importance-based flow time plus energy (IbFt+E), wherein the jobs arrive over time and the job’s sizes are known only at completion time. Every processor can execute at a different speed, to reduce the energy consumption. MBS is using the tradition power function and bounded speed model. The functioning of MBS is evaluated by utilizing potential function analysis against an offline adversary. For processors m ≥ 2, MBS is O(1)-competitive. The working of a set of jobs is simulated to compare MBS with the best known non-clairvoyant scheduling. The comparative analysis shows that the MBS outperforms other algorithms. The competitiveness of MBS is the least to date.

Preemption-Aware Energy Management in Virtualized Data Centers

2012 ◽  
Author(s):  
Mohsen Amini Salehi ◽  
P. Radha Krishna ◽  
Krishnamurty Sai Deepak ◽  
Rajkumar Buyya
Keyword(s):  
Energy Management ◽  
Data Centers ◽  
Virtualized Data Centers

scholarly journals PENYELESAIAN MULTI TRAVELING SALESMAN PROBLEM DENGAN ALGORITMA GENETIKA

2017 ◽  
Vol 6 (1) ◽  
pp. 1
Author(s):  
NI KADEK MAYULIANA ◽  
EKA N. KENCANA ◽  
LUH PUTU IDA HARINI
Keyword(s):  
Genetic Algorithm ◽  
Traveling Salesman Problem ◽  
Heuristic Algorithm ◽  
Minimum Distance ◽  
Processing Time ◽  
Traveling Salesman ◽  
Running Time ◽  
Shortest Route ◽  
Time Required

Genetic algorithm is a part of heuristic algorithm which can be applied to solve various computational problems. This work is directed to study the performance of the genetic algorithm (GA) to solve Multi Traveling Salesmen Problem (multi-TSP). GA is simulated to determine the shortest route for 5 to 10 salesmen who travelled 10 to 30 cities. The performance of this algorithm is studied based on the minimum distance and the processing time required for 10 repetitions for each of cities-salesmen combination. The result showed that the minimum distance and the processing time of the GA increase consistently whenever the number of cities to visit increase. In addition, different number of sales who visited certain number of cities proved significantly affect the running time of GA, but did not prove significantly affect the minimum distance.

scholarly journals Statistical Analysis using traditional technique, Microsoft Excel and Predictive Analytic Software

10.17158/514 ◽  
2016 ◽  
Vol 19 (2) ◽  
Author(s):  
Jovelyn M. Durango ◽  
Carlito P. Yurango
Keyword(s):  
Statistical Analysis ◽  
Completion Time ◽  
Microsoft Excel ◽  
Instructional Tools ◽  
Traditional Technique ◽  
Significant Difference ◽  
Before And After ◽  
Computer Based ◽  
The One ◽  
Time Required

<p>The advent of technology has improved the way statistics is taught and learned. It is claimed that the use of computer-based instructional tools can actively explore the meaning of statistical concepts among the students, as well as enhance their learning experiences. This study aimed to compare three methods of statistical analysis namely, the traditional technique (use of the calculator), Microsoft Excel and Statistical Package for Social Sciences (SPSS) software. This investigation utilized the experimental design, specifically the One-Group Pretest – Posttest Design. There were six education students who self-assessed their attitude before and after the introduction of the use of various computation techniques and performed the statistical analysis considering also the completion time required for each process. Results of the study revealed an increase in the level of attitude among the respondents form the pretest to the posttest. Also, the cognitive level regardless of the approach was very high. However, the t-test failed to establish a significant difference in the attitude among the respondents. On the other hand, there were significant differences in both the test scores and completion time of the respondents in the three methods in favor of SPSS.</p><p> </p><p><strong>Keywords: </strong>Information technology, statistics, traditional technique, Microsoft excel, SPSS, comparative analysis, experimental research design, Davao City, Philippines. </p>

A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES

2014 ◽  
Vol 31 (04) ◽  
pp. 1450030 ◽  
Author(s):  
CHENGWEN JIAO ◽  
WENHUA LI ◽  
JINJIANG YUAN
Keyword(s):  
Competitive Ratio ◽  
Completion Time ◽  
Online Algorithm ◽  
Unit Length ◽  
Maximum Flow ◽  
Flow Time ◽  
Release Time ◽  
Batch Machine ◽  
The Difference ◽  
Over Time

We consider online scheduling of unit length jobs on m identical parallel-batch machines. Jobs arrive over time. The objective is to minimize maximum flow-time, with the flow-time of a job being the difference of its completion time and its release time. A parallel-batch machine can handle up to b jobs simultaneously as a batch. Here, the batch capacity is bounded, that is b < ∞. In this paper, we provide a best possible online algorithm for the problem with a competitive ratio of [Formula: see text].

Fluidized bed heat treatment of aluminum cast components

2004 ◽  
Vol 120 ◽  
pp. 555-562
Author(s):  
D. Apelian ◽  
S. K. Chaudhury
Keyword(s):  
Heat Treatment ◽  
Fluidized Bed ◽  
Processing Time ◽  
Reaction Times ◽  
Experimental Results ◽  
Fluidized Bed Reactors ◽  
The Past ◽  
Conventional Furnace ◽  
Time Required ◽  
Solutionizing Time

Heat Treatment and post casting treatments of cast components has always been an important step in the control of microstructure, and resultant properties. In the past, the solutionizing, quenching and ageing process steps may have “required” in total over 20 hours of processing time. With the advent of fluidized bed reactors (FB), processing time has been dramatically reduced. For example, instead of 8-10 hours solutionizing time in a conventional furnace, the time required in FB is less than an hour. Experiments with Al-Si-Mg alloy, (both modified with Sr, and unmodified) were performed, having different diffusion distances (different DAS), and for different reaction times and temperatures. Both the model and the experimental results are presented and discussed.

A STOCHASTIC BATCHING AND SCHEDULING PROBLEM

2001 ◽  
Vol 15 (4) ◽  
pp. 465-479 ◽  
Author(s):  
Ger Koole ◽  
Rhonda Righter
Keyword(s):  
Optimal Policy ◽  
Semiconductor Manufacturing ◽  
Processing Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Flow Time ◽  
Batch Scheduling ◽  
Scheduling Problem ◽  
Processing Times ◽  
Deterministic Problem

We consider a batch scheduling problem in which the processing time of a batch of jobs equals the maximum of the processing times of all jobs in the batch. This is the case, for example, for burn-in operations in semiconductor manufacturing and other testing operations. Processing times are assumed to be random, and we consider minimizing the makespan and the flow time. The problem is much more difficult than the corresponding deterministic problem, and the optimal policy may have many counterintuitive properties. We prove various structural properties of the optimal policy and use these to develop a polynomial-time algorithm to compute the optimal policy.

Sign in / Sign up

Export Citation Format

Share Document