scholarly journals Parallel Scheduling of Grid Jobs on Quadcore Systems using Grouping Methods

2021 ◽  
pp. 21-34
Author(s):  
Goodhead T. Abraham ◽  
Evans F. Osaisai ◽  
Nicholas S. Dienagha
Keyword(s):  
Scheduling Algorithm ◽  
Group Method ◽  
Sequential Method ◽  
System A ◽  
Processing Power ◽  
Significant Performance ◽  
Computing Platforms ◽  
Machine Groups ◽  
Multicore Computers ◽  
Single Processor

As Grid computing continues to make inroads into different spheres of our lives and multicore computers become ubiquitous, the need to leverage the gains of multicore computers for the scheduling of Grid jobs becomes a necessity. Most Grid schedulers remain sequential in nature and are inadequate in meeting up with the growing data and processing need of the Grid. Also, the leakage of Moore’s dividend continues as most computing platforms still depend on the underlying hardware for increased performance. Leveraging the Grid for the data challenge of the future requires a shift away from the traditional sequential method. This work extends the work of [1] on a quadcore system. A random method was used to group machines and the total processing power of machines in each group was computed, a size proportional to speed method is then used to estimates the size of jobs for allocation to machine groups. The MinMin scheduling algorithm was implemented within the groups to schedule a range of jobs while varying the number of groups and threads. The experiment was executed on a single processor system and on a quadcore system. Significant improvement was achieved using the group method on the quadcore system compared to the ordinary MinMin on the quadcore. We also find significant performance improvement with increasing groups. Thirdly, we find that the MinMin algorithm also gained marginally from the quadcore system meaning that it is also scalable.

scholarly journals HPEFT for Hierarchical Heterogeneous Multi-DAG in a Multigroup Scan UPA System

Electronics ◽  
2019 ◽  
Vol 8 (5) ◽  
pp. 498
Author(s):  
Yuzhong Li ◽  
Wenming Tang ◽  
Guixiong Liu
Keyword(s):  
Signal Processing ◽  
Scheduling Algorithm ◽  
Frame Rate ◽  
Hierarchical Processing ◽  
Finish Time ◽  
System A ◽  
Time Period ◽  
Upa System ◽  
Ultrasonic Phased Array ◽  
Earliest Finish Time

Multidirected acyclic graph (DAG) workflow scheduling is a key problem in the heterogeneous distributed environment in the distributed computing field. A hierarchical heterogeneous multi-DAG workflow problem (HHMDP) was proposed based on the different signal processing workflows produced by different grouping and scanning modes and their hierarchical processing in specific functional signal processing modules in a multigroup scan ultrasonic phased array (UPA) system. A heterogeneous predecessor earliest finish time (HPEFT) algorithm with predecessor pointer adjustment was proposed based on the improved heterogeneous earliest finish time (HEFT) algorithm. The experimental results denote that HPEFT reduces the makespan, ratio of the idle time slot (RITS), and missed deadline rate (MDR) by 3.87–57.68%, 0–6.53%, and 13–58%, respectively, and increases relative relaxation with respect to the deadline (RLD) by 2.27–8.58%, improving the frame rate and resource utilization and reducing the probability of exceeding the real-time period. The multigroup UPA instrument architecture in multi-DAG signal processing flow was also provided. By simulating and verifying the scheduling algorithm, the architecture and the HPEFT algorithm is proved to coordinate the order of each group of signal processing tasks for improving the instrument performance.

scholarly journals Limited Non-Preemptive EDF Scheduling for a Real-Time System with Symmetry Multiprocessors

Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 172 ◽  
Author(s):  
Hoyoun Lee ◽  
Jinkyu Lee
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Schedulability Analysis ◽  
Timing Constraints ◽  
Limited Information ◽  
Time System ◽  
Real Time System ◽  
System A ◽  
The Future ◽  
Earliest Deadline

In a real-time system, a series of jobs invoked by each task should finish its execution before its deadline, and EDF (Earliest Deadline First) is one of the most popular scheduling algorithms to meet such timing constraints of a set of given tasks. However, EDF is known to be ineffective in meeting timing constraints for non-preemptive tasks (which disallow any preemption) when the system does not know the future job release patterns of the tasks. In this paper, we develop a scheduling algorithm for a real-time system with a symmetry multiprocessor platform, which requires only limited information about the future job release patterns of a set of non-preemptive tasks, called LCEDF. We then derive its schedulability analysis that provides timing guarantees of the non-preemptive task set on a symmetry multiprocessor platform. Via simulations, we demonstrate the proposed schedulability analysis for LCEDF significantly improves the schedulability performance in meeting timing constraints of a set of non-preemptive tasks up to 20.16%, compared to vanilla non-preemptive EDF.

scholarly journals The Influence of Environmental Features on the Morphometric Variation in Mauritia flexuosa L.f. Fruits and Seeds

Plants ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1304
Author(s):  
Nilo L. Sander ◽  
Carolina J. da Silva ◽  
Aline V. M. Duarte ◽  
Bruno W. Zago ◽  
Carla Galbiati ◽  
...  
Keyword(s):  
Single Species ◽  
Fruit Weight ◽  
Group Method ◽  
Phenotypic Traits ◽  
Sequential Method ◽  
Morphometric Variation ◽  
Pair Group ◽  
Mauritia Flexuosa ◽  
The Difference ◽  
Fresh Pulp

The environmental heterogeneity may reflect the different morphological and phenotypic traits of individuals belonging to a single species. We used 14 morphological traits of Mauritia flexuosa L.f. to understanding the relation between environment and phenotypic traits. Twenty-five fruits were collected from each of the 10 individuals sampled in each study site: Chapada dos Guimarães (CG), Vila Bela da Santíssima Trindade (VB), and Alta Floresta (AF). We analyzed the genetic divergence, using the standardized Euclidean distance, the sequential method of Tocher, unweighted pair group method with arithmetic mean (UPGMA), and the projection of the distances onto 2D plane, and calculated the relative importance of the traits evaluated. The analysis showed the partition of individuals into three main groups: Two groups comprising the majority of individuals. Fresh fruit weight, pulp rate, fresh pulp weight, and moisture rate were the traits that most helped explaining the difference between materials. The results shown in the current study evidenced the influence of these three different environments on the biometric traits of M. flexuosa. Such influence has led to the formation of Alta Floresta and Vila Bela da Santíssima Trindade individuals in different groups, whereas the Chapada dos Guimarães individuals were able to permeate the two other groups, although they showed stronger tendency to group with individuals from Vila Bela da Santíssima Trindade.

scholarly journals Layered-Division Multiplexing in 5G New -Radio for Terrestrial Broadcast Services

2021 ◽  
Vol 12 (3) ◽  
pp. 5183-5190
Author(s):  
MadhusmitaShial Et. al.
Keyword(s):  
Third Generation ◽  
System A ◽  
Multicast Service ◽  
New Radio ◽  
Sim Card ◽  
Significant Performance ◽  
Multimedia Broadcast Multicast Service ◽  
Multicast Services ◽  
User Device ◽  
Third Generation Partnership Project

The 5G system can deliver simultaneouslyunicast services, multicast services and broadcast services using the conventional high-power high- tower (HPHT) infrastructure and with the same spectrum.The Third Generation Partnership Project (3GPP) LTEevolved -multimedia broadcast- multicast service (eMBMS) have new features designed for Terrestrial Broadcast services in Release 14.  A broadcast service means only receive mode, only downlink no uplink or inserting a SIM card not needed. In free to air reception without a SIM card or without user device registration with the network the content can be received. This specification is standardized in release 15. In this study a two layer Layered-Division Multiplexing (LDM) is used in 5G new radio (NR).A significant performance could be analyzed in a 5G- NRMBMS  by using two layer LDM system for delivering terrestrial broadcast services. The performance analysis demonstrated by computer simulations. Using two-layer LDM in 5G-NRMBMS system a high-qualityservice can be provided to both handheld and fixed devices

Data Placement Oriented Scheduling Algorithm for Scheduling Scientific Workflow in Cloud: A Budget-Aware Approach

2020 ◽  
Vol 13 (5) ◽  
pp. 871-883
Author(s):  
Avinash Kaur ◽  
Pooja Gupta ◽  
Parminder Singh ◽  
Manpreet Singh
Keyword(s):  
State Of The Art ◽  
Scheduling Algorithm ◽  
Cloud Service ◽  
Data Placement ◽  
Scientific Workflow ◽  
Pricing Strategies ◽  
Cloud Service Provider ◽  
Computing Platforms ◽  
Run Up ◽  
Scheduling Heuristic

Background: A large number of communities and enterprises deploy numerous scientific workflow applications on cloud service. Aims: The main aim of the cloud service provider is to execute the workflows with a minimal budget and makespan. Most of the existing techniques for budget and makespan are employed for the traditional platform of computing and are not applicable to cloud computing platforms with unique resource management methods and pricing strategies based on service. Methods: In this paper, we studied the joint optimization of cost and makespan of scheduling workflows in IaaS clouds, and proposed a novel workflow scheduling scheme. Also, data placement is included in the proposed algorithm. Results: In this scheme, DPO-HEFT (Data Placement Oriented HEFT) algorithm is developed which closely integrates the data placement mechanism with the list scheduling heuristic HEFT. Extensive experiments using the real-world and synthetic workflow demonstrate the efficacy of our scheme. Conclusion: Our scheme can achieve significantly better cost and makespan trade-off fronts with remarkably higher hypervolume and can run up to hundreds times faster than the state-of-the-art algorithms.

Adaptive Scheduling for Real-Time Distributed Systems

2014 ◽  
pp. 236-248 ◽  
Author(s):  
Apurva Shah
Keyword(s):  
Data Mining ◽  
Distributed Systems ◽  
Real Time ◽  
Scheduling Algorithm ◽  
Fast Response ◽  
Biologically Inspired ◽  
Real Time Processing ◽  
Time Systems ◽  
Earliest Deadline ◽  
Single Processor

Biologically inspired data mining techniques have been intensively used in different data mining applications. Ant Colony Optimization (ACO) has been applied for scheduling real-time distributed systems in the recent time. Real-time processing requires both parallel activities and fast response. It is required to complete the work and deliver services on a timely basis. In the presence of timing, a real-time system's performance does not always improve as processor and speed increases. ACO performs quite well for scheduling real-time distributed systems during overloaded conditions. Earliest Deadline First (EDF) is the optimal scheduling algorithm for single processor real-time systems during under-loaded conditions. This chapter proposes an adaptive algorithm that takes advantage of EDF- and ACO-based algorithms and overcomes their limitations.

Computerized System for Efficient Scheduling of Highway Construction

2005 ◽  
Vol 1907 (1) ◽  
pp. 8-14 ◽  
Author(s):  
Tarek Hegazy
Keyword(s):  
Resource Constraints ◽  
Scheduling Algorithm ◽  
Optimization Technique ◽  
Cost Optimization ◽  
Highway Construction ◽  
Schedule Optimization ◽  
Construction Methods ◽  
System A ◽  
Practical Model ◽  
Computerized System

A practical model for scheduling and cost optimization of highway construction is presented in this paper. The model's objective is to minimize total construction cost while respecting the time and resource constraints of a project. For flexibility, the model allows each activity to have three alternative construction methods, from cheap and slow to fast and expensive. At the core of the model is an innovative scheduling algorithm for crew assignments along the various highway sections so that work continuity is maintained. The model is designed to be flexible enough to allow nontypical sections as well as variable sequence of work among the sections. For cost optimization, the model uses a nontraditional optimization technique, genetic algorithms. Details of the model formulation are presented in this paper along with its implementation in a simple-to-use computer system. To demonstrate the capabilities of the system, a realistic example is given of a highway project that is fast-tracked by using two crews working simultaneously from opposite sides. The example shows the usefulness of the system for what-if analysis, schedule optimization, and legible presentation of detailed crew assignments and activities’ progress speeds. Extensions of the model to incorporate project control features are then highlighted.

Sign in / Sign up

Export Citation Format

Share Document