A Review of Dynamic Scheduling Algorithms for Homogeneous and Heterogeneous Systems

Alam, Mahfooz; Khan, Asif; Varshney, Ankur Kumar

doi:10.1007/978-981-10-8533-8_8

Cited by 10 publications

(10 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4d which is not very useful. Using the interleaved modifier on either side of the connection in line 7, we can modify the unfolding Fork-Join dst src wrk [2] wrk [1] wrk [0] out [1] out [3] out [0] in [0] in [1] in [2] in out in out in out…”

Section: Scalable Connection Patternsmentioning

confidence: 99%

High-Performance Deterministic Concurrency using Lingua Franca

Menard¹,

Lohstroh²,

Bateni³

et al. 2023

Preprint

View full text Add to dashboard Cite

Actor frameworks and similar reactive programming techniques are widely used for building concurrent systems. They promise to be efficient and scale well to a large number of cores or nodes in a distributed system. However, they also expose programmers to nondeterminism, which often makes implementations hard to understand, debug, and test. The recently proposed reactor model is a promising alternative that enables efficient deterministic concurrency. In this paper, we show that determinacy does neither imply a loss in expressivity nor in performance. To show this, we evaluate Lingua Franca (LF), a reactor-oriented coordination language that equips mainstream programming languages with a concurrency model that automatically takes advantage of opportunities to exploit parallelism that do not introduce nondeterminism. Our implementation of the Savina benchmark suite demonstrates that, in terms of execution time, the runtime performance of LF programs even exceeds popular and highly optimized actor frameworks. We compare against Akka and CAF, which LF outperforms by 1.86𝑥 and 1.42𝑥, respectively.CCS Concepts: • Computing methodologies → Concurrent programming languages; • Software and its engineering → Runtime environments; Source code generation.

show abstract

Section: Scalable Connection Patternsmentioning

confidence: 99%

High-Performance Deterministic Concurrency using Lingua Franca

Menard¹,

Lohstroh²,

Bateni³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…In dynamic scheduling, scheduling judgments are made at run time [26]. Furthermore, static scheduling can be categorized into two types namely dependent task and independent task scheduling [19]. In dependent task scheduling, a task depends on other tasks, cannot be processed until all the dependent tasks finish.…”

Section: Related Workmentioning

confidence: 99%

“…Thus, the proposed model of this work makes the secured task allocation algorithms and also improves the flowtime, security overhead and failure probability over the ESTA and other existing methods. ESTA [19] is the most recent task allocation algorithm for independent BoT and is used in cloud computing.…”

Section: Proposed Modelmentioning

confidence: 99%

A Secure and Robust Trust-Based Task Allocation Model for Batch-of-Tasks (BoT) in Cloud Computing

Haidri¹,

Alam

Mahak

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

Security is emerging as an essential issue in the design of infrastructure-as-a-service (IaaS) cloud environment applications, which are broadly used in micro-system reliability, transaction processing system, e-commerce services, digital computers for government and medical electronics. Here, the security-driven allocation of Batch of Tasks (BoT) in cloud system is a challenging issue and has been reported as a well-known NP-complete problem. So, many models have been developed, however, existing trust-based models do not factor in security demand properly when making the decision and assigning the cloudlets/tasks. To design a trust-based task allocation model, evaluation and computation of security overhead are needed. The proposed model is negotiating the cipher suite between the task and computing resource in the form of security demand. Furthermore, this paper proposes Security Aware Efficient Static Task Allocation (SA-ESTA) and Security Prioritized Efficient Static Task Allocation (SP-ESTA) algorithms which integrate security demands and trust level into allocation for the IaaS Cloud environment. The proposed algorithms schedule a BoT, on virtual machines (VMs) in order to optimize the flowtime, security overhead, and system failure probability. To evaluate the performance of SA-ESTA and SP-ESTA, the experimental study based on random test-bed trace has been conducted and compared with four other existing baselines and three traditional algorithms on account of flowtime, security overhead and failure probability. Our meticulous performance simulation results clearly show that the proposed algorithms perform better than the peer algorithms under various test conditions.

show abstract

“…That makes specific constraints concerning computing resource recovery, preemption and interruption time, tasks' migration between different executing resources, limited memory and power use, hardware costs, etc. [7]. To overcome such complexities, high-level development techniques are required.…”

Section: Introductionmentioning

confidence: 99%

A Model-Driven Approach for Reconfigurable Systems Development

Ktata¹,

Kharroubi²

2020

Adv. sci. technol. eng. syst. j.

View full text Add to dashboard Cite

Reconfigurable systems are considered as promising technology that enables the design of more flexible and dynamic applications. However, actually existent design flows are either low-level (so complex) or they lack support for automatic synthesis. In this paper, we present an ontology-based modeling approach for reconfigurable systems. Our approach is based on model-driven engineering process and addresses dynamic features on application-level enabling early exploration of the execution behavior of the system. The model is characterized by a logical and syntactical description conform with application domain knowledge and respect a number of metamodel constraints. These elements are semantically presented by an ontology language. We successfully implemented a system model with several tasks and resources and made scheduling test for the application graph.

show abstract

A Review of Dynamic Scheduling Algorithms for Homogeneous and Heterogeneous Systems

Cited by 10 publications

References 14 publications

High-Performance Deterministic Concurrency using Lingua Franca

High-Performance Deterministic Concurrency using Lingua Franca

A Secure and Robust Trust-Based Task Allocation Model for Batch-of-Tasks (BoT) in Cloud Computing

A Model-Driven Approach for Reconfigurable Systems Development

Contact Info

Product

Resources

About