发布求助
文献互助 智能选刊 最新文献

International Journal of Parallel Emergent and Distributed Systems最新文献

筛选
英文 中文
Embedding spanning disjoint cycles in augmented cube networks with prescribed vertices in each cycle 在增广立方体网络中嵌入跨越不相交的环，每个环中有规定的顶点
IF 1.1
International Journal of Parallel Emergent and Distributed Systems Pub Date : 2023-07-17 DOI: 10.1080/17445760.2023.2231162
Weiyan Wu, Eminjan Sabir, Hongwei Qiao
{"title":"Embedding spanning disjoint cycles in augmented cube networks with prescribed vertices in each cycle","authors":"Weiyan Wu, Eminjan Sabir, Hongwei Qiao","doi":"10.1080/17445760.2023.2231162","DOIUrl":"https://doi.org/10.1080/17445760.2023.2231162","url":null,"abstract":"One of the important issues in evaluating an interconnection network is to study the Hamiltonian cycle embedding problems. For a positive integer k, a graph G is said to be spanning k-cyclable if for k prescribed vertices , there exist k disjoint cycles such that the union of spans G, and each contains exactly one vertex of . According to the definition, the problem of finding hamiltonian cycle focuses on k = 1. The notion of spanning cyclability can be applied to the problem of identifying faulty processors and other related issues in interconnection networks. The n-dimensional augmented cube is an important node-symmetric variant of the n-dimensional hypercube . In this paper, we prove that with is spanning k-cyclable for .","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44136537","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
An adaptive approach for compression format based on bagging algorithm 一种基于装袋算法的自适应压缩格式方法
IF 1.1
International Journal of Parallel Emergent and Distributed Systems Pub Date : 2023-07-13 DOI: 10.1080/17445760.2023.2231291
Huanyu Cui, Qilong Han, Nianbin Wang, Ye Wang
{"title":"An adaptive approach for compression format based on bagging algorithm","authors":"Huanyu Cui, Qilong Han, Nianbin Wang, Ye Wang","doi":"10.1080/17445760.2023.2231291","DOIUrl":"https://doi.org/10.1080/17445760.2023.2231291","url":null,"abstract":"ABSTRACT The traditional parallel Sparse matrix vector multiplication (SpMV) method has been optimized by an application-specific or compression format-specific. However, a single compression format cannot deal with all sparse matrix types effectively in practical applications. To solve this problem, an adaptive compression format based on Bagging ensemble learning algorithm is proposed in this paper. Experiments show that the adaptive compression format has higher prediction and computational performance on NVIDIA V100 and NVIDIA RTX 2080Ti. Compared with SpMV of the four compression formats, SpMV based on adaptive compression format reduces the execution time of 1.5×, 6.6×, 9× and 1.1×, respectively.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42747936","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
Block size, parallelism and predictive performance: finding the sweet spot in distributed learning 块大小、并行性和预测性能：在分布式学习中寻找最佳点
IF 1.1
International Journal of Parallel Emergent and Distributed Systems Pub Date : 2023-06-27 DOI: 10.1080/17445760.2023.2225854
Filipe Oliveira, Davide Carneiro, Miguel Guimarães, Óscar Oliveira, P. Novais
{"title":"Block size, parallelism and predictive performance: finding the sweet spot in distributed learning","authors":"Filipe Oliveira, Davide Carneiro, Miguel Guimarães, Óscar Oliveira, P. Novais","doi":"10.1080/17445760.2023.2225854","DOIUrl":"https://doi.org/10.1080/17445760.2023.2225854","url":null,"abstract":"","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46566985","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
Split consensus for object security 对象安全性的分歧共识
IF 1.1
International Journal of Parallel Emergent and Distributed Systems Pub Date : 2023-06-15 DOI: 10.1080/17445760.2023.2225217
L. Lopriore
{"title":"Split consensus for object security","authors":"L. Lopriore","doi":"10.1080/17445760.2023.2225217","DOIUrl":"https://doi.org/10.1080/17445760.2023.2225217","url":null,"abstract":"We present a set of security mechanisms supporting a form of split consensus between subjects that grant permissions to exert rights to access objects, and subjects that hold these rights. Our solution is based on lock-key pairs. A key specifies a collection of access rights, and a category for each access right. For each category, a lock states whether an access right in that category is valid, or not. We illustrate a few examples of applications, including file security, a form of priority-based access control, access control lists, and capability lists supporting hierarchical object structures.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47416821","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
Omega multistage interconnection network manages double-pattern traffic with a regulator and high-speed forwarding method Omega多级互联网络通过调节器和高速转发方法管理双模式流量
IF 1.1
International Journal of Parallel Emergent and Distributed Systems Pub Date : 2023-06-05 DOI: 10.1080/17445760.2023.2220142
E. Stergiou, D. Liarokapis, S. Margariti, Ilias Bombotsaris
{"title":"Omega multistage interconnection network manages double-pattern traffic with a regulator and high-speed forwarding method","authors":"E. Stergiou, D. Liarokapis, S. Margariti, Ilias Bombotsaris","doi":"10.1080/17445760.2023.2220142","DOIUrl":"https://doi.org/10.1080/17445760.2023.2220142","url":null,"abstract":"This study proposes a flexible and effective solution for developing high-performance multistage interconnection networks to maximize the performance of parallel computer systems, cloud computing infrastructure, grids, etc. An omega-type multistage interconnection network, consisting of regulated switchboxes, is used as a testbed to handle flexible two-class load patterns. The wormhole routing method and a special forwarding technique controlled by a global regulator are adopted to alleviate internal ‘tree saturation’ caused by periodic hotspot traffic combined with uniform traffic. Simulation experiments prove that this concept reduces packet latency, and an additional layer inserted in the final stage further improves the network’s architecture. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46489242","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
Monitoring edge-geodetic numbers of convex polytopes and four networks 凸多面体和四个网络的边大地测量数监测
IF 1.1
International Journal of Parallel Emergent and Distributed Systems Pub Date : 2023-06-05 DOI: 10.1080/17445760.2023.2220143
Ao Tan, Wen Li, Xiumin Wang, X. Li
{"title":"Monitoring edge-geodetic numbers of convex polytopes and four networks","authors":"Ao Tan, Wen Li, Xiumin Wang, X. Li","doi":"10.1080/17445760.2023.2220143","DOIUrl":"https://doi.org/10.1080/17445760.2023.2220143","url":null,"abstract":"Foucard, Krishna and Lekshmi introduced a new graph-theoretic concept in the area of network monitoring. Let G be a graph with vertex set , there exists a subset , if deleting any edge in G, one can find that there exist at least two vertices in S whose distance is changed, then we call S is a monitoring edge-geodetic set (MEG-set for short). The minimum size of the MEG-set of G is called the monitoring edge-geodetic number of G (meg(G) for short). In this paper, we study the monitoring edge-geodetic number of some well-known networks, including Ladder, butterfly, circulant and Benes networks and convex polytopes.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46949791","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
Towards a DISSECT-CF extension for simulating function-as-a-service 模拟功能即服务的DISSECT-CF扩展
IF 1.1
International Journal of Parallel Emergent and Distributed Systems Pub Date : 2023-06-03 DOI: 10.1080/17445760.2023.2220141
D. Sallo, G. Kecskeméti
{"title":"Towards a DISSECT-CF extension for simulating function-as-a-service","authors":"D. Sallo, G. Kecskeméti","doi":"10.1080/17445760.2023.2220141","DOIUrl":"https://doi.org/10.1080/17445760.2023.2220141","url":null,"abstract":"ABSTRACT Serverless computing is a new way of delivering cloud services that abstracts a user from the burden of managing resources and infrastructure. Although a few serverless simulators have been developed, they do not compare to services that are offered by commercial providers. Developing a comprehensive serverless simulation framework is essential towards evaluating scenarios reliant on the serverless paradigm. This paper focuses on introducing a serverless computing model to the DIScrete event baSed Energy Consumption simulaTor for Clouds and Federations (DISSECT-CF) simulator to enable simulating realistic function-as-a-service (FaaS) solutions. This new model is capable of imitating serverless providers in terms of cost model, associating triggers, extracting performance metrics, and customising the configurations of functions. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43694321","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
The unified effect of data encoding, ansatz expressibility and entanglement on the trainability of HQNNs 数据编码、解析可表达性和纠缠对hqnn可训练性的统一影响
IF 1.1
International Journal of Parallel Emergent and Distributed Systems Pub Date : 2023-05-08 DOI: 10.1080/17445760.2023.2231163
Muhammad Kashif, S. Al-Kuwari
{"title":"The unified effect of data encoding, ansatz expressibility and entanglement on the trainability of HQNNs","authors":"Muhammad Kashif, S. Al-Kuwari","doi":"10.1080/17445760.2023.2231163","DOIUrl":"https://doi.org/10.1080/17445760.2023.2231163","url":null,"abstract":"Recent advances in quantum computing and machine learning have brought about a promising intersection of these two fields, leading to the emergence of quantum machine learning (QML). However, the integration of quantum computing and machine learning poses several challenges. One of the prominent challenges lies in the presence of barren plateaus (BP) in QML algorithms, particularly in quantum neural networks (QNNs). Recent studies have successfully identified the fundamental causes underlying the existence of BP in QNNs. This paper presents a framework designed to explore the interplay of multiple factors contributing to the BP problem in quantum neural networks (QNNs), which poses a critical challenge for the practical applications of QML. We focus on the combined influence of data encoding, qubit entanglement, and ansatz expressibility in hybrid quantum neural networks (HQNNs) for multi-class classification tasks. Our framework aims to empirically analyze the joint impact of these factors on the training landscape of HQNNs. Our results show that the occurrence of the BP problem in HQNNs is contingent upon the expressibility of the underlying ansatz and the type of the adopted data encoding technique. Additionally, we observe that qubit entanglement also plays a role in exacerbating the BP problem. Leveraging various evaluation metrics for classification tasks, we systematically evaluate the performance of HQNNs and provide recommendations tailored to different constraint scenarios. Our findings emphasize the significance of our framework in addressing the practical success of QNNs.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42905256","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
Minimal synchrony for implementing Timely Provable Reliable Send primitive with Byzantine failures 实现拜占庭式故障的及时可证明可靠发送原语的最小同步性
IF 1.1
International Journal of Parallel Emergent and Distributed Systems Pub Date : 2023-04-27 DOI: 10.1080/17445760.2023.2199992
Mohamed Ben Othmane, Abderrahim Siam, Moumen Hamouma
{"title":"Minimal synchrony for implementing Timely Provable Reliable Send primitive with Byzantine failures","authors":"Mohamed Ben Othmane, Abderrahim Siam, Moumen Hamouma","doi":"10.1080/17445760.2023.2199992","DOIUrl":"https://doi.org/10.1080/17445760.2023.2199992","url":null,"abstract":"Broadcast abstractions are among the most important concepts in the field of fault tolerant distributed computing. These abstractions are used by consensus algorithms as a fundamental building block for ensuring that all correct processes in the system decide the same value. The Timely Provable Reliable Send primitive is among these broadcast abstractions with which we guarantee that messages are delivered correctly and in a timely manner, even in the presence of faulty processes. In this paper, we present an authenticated algorithm implementing provable reliable send primitive with very few eventually synchronous links. In other words, this algorithm assumes that there is a -sink in the system. A -sink is a correct process where the number of incoming eventually timely links that connecting it with correct processes is (including itself). We also show that a -sink is the minimal synchrony assumption for implementing this primitive in a Byzantine system where an authentication mechanism is available. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46790747","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
On-chain global maintenance services: technical, legal and managerial implications 链上全球维护服务:技术、法律和管理影响
IF 1.1
International Journal of Parallel Emergent and Distributed Systems Pub Date : 2023-04-20 DOI: 10.1080/17445760.2023.2192933
A. Vitaletti, M. Pizzonia, Marco Zecchini, Diego Pennino, Salvatore Esposito De Falco, Francesco Pacileo, Alessandro Bellini, António Bonifácio, Domenico Sardanelli, Pietro Vito, Simone Naldini
{"title":"On-chain global maintenance services: technical, legal and managerial implications","authors":"A. Vitaletti, M. Pizzonia, Marco Zecchini, Diego Pennino, Salvatore Esposito De Falco, Francesco Pacileo, Alessandro Bellini, António Bonifácio, Domenico Sardanelli, Pietro Vito, Simone Naldini","doi":"10.1080/17445760.2023.2192933","DOIUrl":"https://doi.org/10.1080/17445760.2023.2192933","url":null,"abstract":"","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2023-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46146596","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信