A Comprehensive Review of Evolutionary Algorithms for Multiprocessor DAG Scheduling

Silva, Eduardo C. da; Gabriel, Paulo Henrique Ribeiro

doi:10.3390/computation8020026

Cited by 17 publications

(7 citation statements)

References 53 publications

(90 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We summarize the four databases considered in this SLR in Table 1. Furthermore, it is important to highlight here that ACM Digital Library 1 has not been deemed because of the same reasons depicted in previous studies such as [16]. In a few words, this search engine does not efficiently deal with the principal components of the search key, providing less satisfactory results in comparison to the other four scientific databases.…”

Section: Research Protocolmentioning

confidence: 92%

“…In this kind of studies, an special analysis is carried out on the meta-data of each selected paper, in order to obtain findings such as the most cited works, the geographical situation of the research community, or the type of papers preferred by practitioners. As can be read in works such as [16], one of the advantages of SLRs is its replicability, as well as its adequacy for depicting the past and current status of a certain research field. Another advantage of SLRs is their inherent facility for being extended with additional studies.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Systematic Literature Review of Quantum Computing for Routing Problems

2022

View full text Add to dashboard Cite

Quantum Computing is drawing a significant attention from the current scientific community. The potential advantages offered by this revolutionary paradigm has led to an upsurge of scientific production in different fields such as economics, industry, or logistics. The main purpose of this paper is to collect, organize and systematically examine the literature published so far on the application of Quantum Computing to routing problems. To do this, we embrace the well-established procedure named as Systematic Literature Review. Specifically, we provide a unified, self-contained, and end-to-end review of 18 years of research (from 2004 to 2021) in the intersection of Quantum Computing and routing problems through the analysis of 53 different papers. Several interesting conclusions have been drawn from this analysis, which has been formulated to give a comprehensive summary of the current state of the art by providing answers related to the most recurrent type of study (practical or theoretical), preferred solving approaches (dedicated or hybrid), detected open challenges or most used Quantum Computing device, among others.

show abstract

Section: Research Protocolmentioning

confidence: 92%

Section: Introductionmentioning

confidence: 99%

A Systematic Literature Review of Quantum Computing for Routing Problems

2022

View full text Add to dashboard Cite

show abstract

“…WMN routing comprises of two different steps, forwarding to the next node and decision making to select the next node so that gets reached the target with minimal cost in terms of the number of nodes traversed. The WMN routing problem is NP-hard [20][21][22][23] which requires efficient solutions.…”

Section: Literature Reviewmentioning

confidence: 99%

“…One of the extensively used complex problems due to its simple description is the routing problem which is NP-hard. [20][21][22][23] This problem becomes more difficult when it involves optimization of the QoS Parameters. To solve this difficult problem, the exact techniques indicate exponential time complexity.…”

Section: Proposed Model and Analysismentioning

confidence: 99%

See 1 more Smart Citation

Optimization of reinforcement routing for wireless mesh network using machine learning and high‐performance computing

Singh

Prakash

Singh

2022

Concurrency and Computation

View full text Add to dashboard Cite

In the modern world, wireless mesh networks (WMN) are widely used in Internet of Things (IoT) applications. It is a dynamic, infrastructure-less multihop network with mobility features. In WMN, to design an effective and strong routing protocol is a challenge. Conventional protocols for routing using a remote vector or link-state routing are not ideal for a wireless network. The shortest routing path is used with all current traditional routing protocols to pick a route with a minimum number of hops. The decisions must be done in real-time in high-traffic networks for the route selection and for the packets to be diversified into other routes. The routing protocols should adapt to the traffic conditions, that is, the network load changes and the route must be selected accordingly. The route may not be the shortest in number, but the best in terms of the actual time a packet requires to reach the target. The key objective of this research work is to design such an adaptive routing algorithm, while minimizing the delivery time and preventing the network from congestion. The rationale for this research work is to optimize adaptive routing protocol based on reinforcement learning, which efficiently delivers packets in the WMN. The experimental evaluation demonstrates that the obtained results significantly improve the system performance compared to the benchmark routing protocols. The Quality of Service (QoS) parameters such as packet delivery ratio (PDR), delay, and throughput metrics are used to assess the performance of the proposed technique using the NS-3 simulator.

show abstract

Mapping tree‐shaped workflows on systems with different memory sizes and processor speeds

Kulagina

Meyerhenke

Benoît

2023

Concurrency and Computation

View full text Add to dashboard Cite

Directed acyclic graphs are commonly used to model scientific workflows, by expressing dependencies between tasks, as well as the resource requirements of the workflow. As a special case, rooted directed trees occur in several applications, for instance in sparse matrix computations. Since typical workflows are modeled by large trees, it is crucial to schedule them efficiently, so that their execution time (or makespan) is minimized. Furthermore, it is usually beneficial to distribute the execution on several compute nodes, hence increasing the available memory, and allowing us to parallelize parts of the execution. To exploit the heterogeneity of modern clusters in this context, we investigate the partitioning and mapping of tree‐shaped workflows on two types of target architecture models: in AM1, each processor can have a different memory size, and in AM2, each processor can also have a different speed (in addition to a different memory size). We design a three‐step heuristic for AM1, which adapts and extends previous work for homogeneous clusters [Gou C, Benoit A, Marchal L. Partitioning tree‐shaped task graphs for distributed platforms with limited memory. IEEE Trans Parallel Dist Syst 2020; 31(7): 1533–1544]. The changes we propose concern the assignment to processors (accounting for the different memory sizes) and the availability of suitable processors when splitting or merging subtrees. For AM2, we extend the heuristic for AM1 with a two‐phase local search approach. Phase A is a swap‐based hill climber, while (the optional) Phase B is inspired by iterated local search. We evaluate our heuristics for AM1 and AM2 with extensive simulations, and we demonstrate that exploiting the heterogeneity in the cluster significantly reduces the makespan, compared to the state of the art for homogeneous processors.

show abstract

A Comprehensive Review of Evolutionary Algorithms for Multiprocessor DAG Scheduling

Cited by 17 publications

References 53 publications

A Systematic Literature Review of Quantum Computing for Routing Problems

A Systematic Literature Review of Quantum Computing for Routing Problems

Optimization of reinforcement routing for wireless mesh network using machine learning and high‐performance computing

Mapping tree‐shaped workflows on systems with different memory sizes and processor speeds

Contact Info

Product

Resources

About