International Journal of Parallel Emergent and Distributed Systems最新文献_第10页

Modelling distributive computation by selective machines 用选择性机器模拟分布计算

IF 1.1

International Journal of Parallel Emergent and Distributed Systems Pub Date : 2021-09-03 DOI: 10.1080/17445760.2021.1934837

M. Burgin

引用次数: 0

Enhancing parallelism of distributed algorithms with the actor model and a smart data movement technique 利用参与者模型和智能数据移动技术增强分布式算法的并行性

IF 1.1

International Journal of Parallel Emergent and Distributed Systems Pub Date : 2021-08-31 DOI: 10.1080/17445760.2021.1971665

A. Doroshenko, E. Tulika, O. Yatsenko

{"title":"Enhancing parallelism of distributed algorithms with the actor model and a smart data movement technique","authors":"A. Doroshenko, E. Tulika, O. Yatsenko","doi":"10.1080/17445760.2021.1971665","DOIUrl":"https://doi.org/10.1080/17445760.2021.1971665","url":null,"abstract":"ABSTRACT The centralised orchestration technique is often a bad idea for massive parallelism applications if we want to achieve a scalable solution. In this paper for this purpose, the choreography approach is undertaken and some adaptive methods and software tools of distributed implementation are proposed to enhance computation parallelism applied to the optimisation of a class of block-recursive algorithms. A new formal model of distribution and coordination of the tasks in a computing cluster as asynchronous reactive processes with message-passing represented with an actor model and choreography of actors is developed. Also, a new scheme of data placement in a multiprocessor cluster based on prioritisation of block-recursive operations is developed to reduce idling time, data movement time. Adaptive adjustment of the data placement in a cluster at run time to account for current cluster load is developed and an auto-tuning of the actor placement in a cluster based on previous statistics for optimisation is implemented. The experiments show that the choreography of actors allows to remove the central coordinating element, to avoid hard dependencies between cluster nodes, and to achieve a better degree of the parallel applications’ scalability. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"36 1","pages":"565 - 578"},"PeriodicalIF":1.1,"publicationDate":"2021-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48451020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Influence of the multi-resolution technique on tomographic reconstruction in ultrasound tomography 超声层析成像中多分辨率技术对断层重建的影响

IF 1.1

International Journal of Parallel Emergent and Distributed Systems Pub Date : 2021-08-22 DOI: 10.1080/17445760.2021.1967350

L. T. Theu, Q. Tran, Vijender Kumar Solanki, Tatiana R. Shemeleva, Duc-Tan Tran

{"title":"Influence of the multi-resolution technique on tomographic reconstruction in ultrasound tomography","authors":"L. T. Theu, Q. Tran, Vijender Kumar Solanki, Tatiana R. Shemeleva, Duc-Tan Tran","doi":"10.1080/17445760.2021.1967350","DOIUrl":"https://doi.org/10.1080/17445760.2021.1967350","url":null,"abstract":"The greatest advantage of scattering theory-based ultrasound tomography (UT) is its ability to investigate small structures. DBIM is the Distorted Born Iterative Method. The nearest neighbour interpolation method is used to enhance the reconstruction performance and reduce the reconstruction time. The raw (N 1 × N 1) and dense (N 2 × N 2) meshed integration areas are reconstructed in NN 1 and NN 2 iterations, respectively. However, choosing the best value of NN 1 to get the highest performance was not mentioned in previous works. If it is not well chosen, the reconstruction quality is even worse than that when using no interpolation. This study proposes a method to enhance the UT reconstruction by using the nearest neighbour interpolation (MR-DBIM). The corresponding algorithms are specified by the graphical concurrent programming language of Sleptsov nets. Some significant results are (1) the MR-DBIM is only meaningful when (i.e. sparse scattering domain); (2) the best performance is obtained in the DBIM when Nt = Nr , but in the MR-DBIM when Nr = 2Nt ; (3) the well-investigated value of NN 1 is 2 when and is 3 when . GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"36 1","pages":"579 - 593"},"PeriodicalIF":1.1,"publicationDate":"2021-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45990088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Parallel algorithm development and testing using Petri-object simulation 并行算法开发与Petri-object仿真测试

IF 1.1

International Journal of Parallel Emergent and Distributed Systems Pub Date : 2021-07-23 DOI: 10.1080/17445760.2021.1955113

I. V. Stetsenko, A. A. Pavlov, Oleksandra Dyfuchyna

{"title":"Parallel algorithm development and testing using Petri-object simulation","authors":"I. V. Stetsenko, A. A. Pavlov, Oleksandra Dyfuchyna","doi":"10.1080/17445760.2021.1955113","DOIUrl":"https://doi.org/10.1080/17445760.2021.1955113","url":null,"abstract":"Parallel algorithms are problematic to develop because of the negative influence of synchronisation, complicated behaviour of threads’ capturing computing resources. Experimental results show performance time’s strong dependence on algorithm parameters, such as the number of subtasks and the complexity of each task. The optimal value of subtask complexity is revealed for the particular algorithm. It is the same for different complexity of the parallelised task (with the same computing resource). To guarantee algorithm speed-up it is important to have a method for investigating the efficiency of parallel algorithm before its implementation on specified computing resources. Stochastic Petri net potentially could be a high accuracy tool for investigating the efficiency of a parallel algorithm. However, a huge number of elements are needed to compose a model of non-trivial algorithm that limits the application of this tool in practice. Petri-object simulation method allows replication of Petri nets with specified parameters and model creation of a list of linked Petri-objects. Basic templates for the model creation of a multithreaded algorithm are developed. Applying these templates, the model of the parallel discrete event simulation algorithm is developed and investigated. By the model results, the algorithm parameters providing the least performance time can be determined.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"36 1","pages":"549 - 564"},"PeriodicalIF":1.1,"publicationDate":"2021-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/17445760.2021.1955113","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42215247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Spatial specification of hypertorus interconnect by infinite and reenterable coloured Petri nets 基于无限可重入有色Petri网的超拓扑互连空间规范

IF 1.1

International Journal of Parallel Emergent and Distributed Systems Pub Date : 2021-07-20 DOI: 10.1080/17445760.2021.1952580

D. Zaitsev, T. Shmeleva, B. Pröll

{"title":"Spatial specification of hypertorus interconnect by infinite and reenterable coloured Petri nets","authors":"D. Zaitsev, T. Shmeleva, B. Pröll","doi":"10.1080/17445760.2021.1952580","DOIUrl":"https://doi.org/10.1080/17445760.2021.1952580","url":null,"abstract":"Multidimensional torus interconnect finds wide application in modern exascale computing. For models design in high-performance computing, grid and cloud computing, and also systems biology, two basic ways of specifying spatial structures with Petri nets are considered – an infinite Petri net specified by a parametric expression (PE) and a reenterable coloured Petri net (CPN). The paper studies a composition of hypertorus grid models in the form of a PE and a reenterable CPN, their mutual transformations, and unfolding into a place/transition net; the parameters are the number of dimensions and the size of grid. A grid is composed via connection of neighbouring cells by dedicated transitions modelling channels. Reenterable model peculiarities are explained on step-by-step simulation examples. The rules of mutual transformations of Petri net spatial specifications are specified. Comparative investigation of two mentioned forms of spatial specifications is implemented, including analysis techniques and tools. CPNs are convenient for the state space analysis. The main advantage of PEs is the ability to obtain linear invariants and other structural constructs of Petri nets, for instance, siphons and traps, in parametric form that allows us to draw conclusions on Petri net properties for any values of parameters.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"37 1","pages":"1 - 21"},"PeriodicalIF":1.1,"publicationDate":"2021-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/17445760.2021.1952580","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43572163","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Cyclic connectivity of the data center network 数据中心网络的循环连通性

IF 1.1

International Journal of Parallel Emergent and Distributed Systems Pub Date : 2021-07-14 DOI: 10.1080/17445760.2021.1952579

Hongzhou Zhu, J. Meng

引用次数: 0

Realisation of the double sweep method by using a Sleptsov net 用Sleptsov网络实现双扫描方法

IF 1.1

International Journal of Parallel Emergent and Distributed Systems Pub Date : 2021-06-27 DOI: 10.1080/17445760.2021.1945054

A. Kostikov, N. D. Zaitsev, O. Subotin

引用次数: 2

Deep learning on Sleptsov nets Sleptsov网络上的深度学习

IF 1.1

International Journal of Parallel Emergent and Distributed Systems Pub Date : 2021-06-27 DOI: 10.1080/17445760.2021.1945055

T. Shmeleva, J. Owsinski, A. A. Lawan

引用次数: 1

Choice of parallelism: multi-GPU driven pipeline for huge academic backbone network 并行性的选择:多gpu驱动的管道用于庞大的学术骨干网络

IF 1.1

International Journal of Parallel Emergent and Distributed Systems Pub Date : 2021-06-24 DOI: 10.1080/17445760.2021.1941009

R. Ando, Y. Kadobayashi, H. Takakura

引用次数: 2

Byzantine-tolerant uniform node sampling service in large-scale networks 大规模网络中的拜占庭容忍统一节点采样服务

IF 1.1

International Journal of Parallel Emergent and Distributed Systems Pub Date : 2021-06-20 DOI: 10.1080/17445760.2021.1939873

E. Anceaume, Yann Busnel, B. Sericola

{"title":"Byzantine-tolerant uniform node sampling service in large-scale networks","authors":"E. Anceaume, Yann Busnel, B. Sericola","doi":"10.1080/17445760.2021.1939873","DOIUrl":"https://doi.org/10.1080/17445760.2021.1939873","url":null,"abstract":"We consider the problem of achieving uniform node sampling in large scale systems in presence of Byzantine nodes. This service offers a single simple primitive that returns, upon invocation, the identifier of a random node that belongs to the system. We first propose an omniscient strategy that processes on the fly an unbounded and arbitrarily biased input stream made of node identifiers exchanged within the system, and outputs a stream that preserves the uniformity property (same probability to appear in the sample). We show that this property holds despite any arbitrary bias introduced by the adversary. We then propose a strategy that is capable of approximating the omniscient strategy without requiring any prior knowledge on the composition of the input stream. We show through both theoretical analysis and extensive simulations that this strategy accurately approximates the omniscient one. We evaluate the resilience of the strategy by studying two representative attacks. We quantify the minimum number of identifiers that Byzantine nodes must insert in the input stream to prevent uniformity. Finally, we propose a new construction in series that allows to both increase the accuracy of a single sketch and decrease the time to converge to a uniform output stream.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"36 1","pages":"412 - 439"},"PeriodicalIF":1.1,"publicationDate":"2021-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/17445760.2021.1939873","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48862274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1