Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
3.7
2.3
Journals
Algorithms
Special Issues
Algorithms for Distributed Computing
share announcement

Algorithms for Distributed Computing

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Parallel and Distributed Algorithms".

Deadline for manuscript submissions: closed (29 January 2023) | Viewed by 4529

Special Issue Editor

Dr. Lars Nagel

E-Mail Website
Guest Editor
Department of Computer Science, Loughborough University, Loughborough LE11 3TU, UK
Interests: algorithms; random processes; distributed systems; parallel computing; distributed algorithms; scheduling and load balancing; randomised algorithms; CS theory; storage systems
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

We invite you to submit your latest research to this special issue “Algorithms for Distributed Computing”.

While distributed systems have been researched for more than 50 years, their significance is incessantly increasing. With the rise of the internet and networked computing, and with processor speeds reaching their limits, distributed systems and parallel computing are more important than ever, with applications in many different domains. Their success depends on the development and evaluation of practical systems and efficient algorithms and network protocols.

We welcome innovative contributions from all areas of parallel and distributed computing. Topics include, but are not limited to:

  • Algorithm analysis
  • Algorithms for scheduling and load balancing
  • Cloud, fog and edge computing
  • Communication networks
  • Distributed algorithms and systems
  • Distributed algorithms for machine learning and artificial intelligence
  • Distributed computing in natural sciences and mathematics
  • Distributed data structures
  • Distributed graphs algorithms
  • Distributed operating systems
  • High-performance and grid computing
  • Population protocols

Dr. Lars Nagel
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • algorithm analysis
  • scheduling and load balancing
  • cloud, fog and edge computing
  • communication networks
  • distributed algorithms and systems
  • distributed machine learning
  • distributed data structures
  • distributed graphs algorithms
  • distributed operating systems and middleware
  • high-performance and grid computing
  • population protocols

Published Papers (2 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

20 pages, 3897 KiB  
Article
On Bipartite Circulant Graph Decompositions Based on Cartesian and Tensor Products with Novel Topologies and Deadlock-Free Routing
by Ahmed El-Mesady, Aleksandr Y. Romanov, Aleksandr A. Amerikanov and Alexander D. Ivannikov
Algorithms 2023, 16(1), 10; https://doi.org/10.3390/a16010010 - 22 Dec 2022
Cited by 2 | Viewed by 1893
Abstract
Recent developments in commutative algebra, linear algebra, and graph theory allow us to approach various issues in several fields. Circulant graphs now have a wider range of practical uses, including as the foundation for optical networks, discrete cellular neural networks, small-world networks, models [...] Read more.
Recent developments in commutative algebra, linear algebra, and graph theory allow us to approach various issues in several fields. Circulant graphs now have a wider range of practical uses, including as the foundation for optical networks, discrete cellular neural networks, small-world networks, models of chemical reactions, supercomputing and multiprocessor systems. Herein, we are concerned with the decompositions of the bipartite circulant graphs. We propose the Cartesian and tensor product approaches as helping tools for the decompositions. The proposed approaches enable us to decompose the bipartite circulant graphs into many categories of graphs. We consider the use cases of applying the described theory of bipartite circulant graph decomposition to the problems of finding new topologies and deadlock-free routing in them when building supercomputers and networks-on-chip. Full article
(This article belongs to the Special Issue Algorithms for Distributed Computing)
►▼ Show Figures

Graphical abstract

19 pages, 3621 KiB  
Article
An Efficient Parallel Algorithm for Detecting Packet Filter Conflicts
by Chun-Liang Lee, Guan-Yu Lin and Yaw-Chung Chen
Algorithms 2022, 15(7), 237; https://doi.org/10.3390/a15070237 - 7 Jul 2022
Cited by 1 | Viewed by 1671
Abstract
Advanced network services, such as firewalls, policy-based routing, and virtual private networks, must rely on routers to classify packets into different flows based on packet headers and predefined filter tables. When multiple filters are overlapped, conflicts may occur, leading to ambiguity in the [...] Read more.
Advanced network services, such as firewalls, policy-based routing, and virtual private networks, must rely on routers to classify packets into different flows based on packet headers and predefined filter tables. When multiple filters are overlapped, conflicts may occur, leading to ambiguity in the packet classification. Conflict detection ensures the correctness of packet classification and has received considerable attention in recent years. However, most conflict-detection algorithms are implemented on a conventional central processing unit (CPU). Compared with a CPU, a graphics processing unit (GPU) exhibits higher computing power with parallel computing, hence accelerates the execution speed of conflict detection. In this study, we employed a GPU to develop two efficient algorithms for parallel conflict detection: the general parallel conflict-detection algorithm (the GPCDA) and the enhanced parallel conflict-detection algorithm (the EPCDA). In the GPCDA, we demonstrate how to perform conflict detection through parallel execution on GPU cores. While in the EPCDA, we analyze the critical procedure in conflict detection as to reduce the number of matches required for each filter. In addition, the EPCDA adopts a workload balance method to enable load balancing of GPU execution threads, thereby significantly improving performance. The simulation results show that with the 100 K filter database, the GPCDA and the EPCDA execute conflict detection 2.8 to 13.9 and 9.4 to 33.7 times faster, respectively, than the CPU-based algorithm. Full article
(This article belongs to the Special Issue Algorithms for Distributed Computing)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-2
Back to TopTop