Pub Date : 2020-06-01DOI: 10.1142/s0129626420500073
A. Algosaibi, K. Ragab, Saleh Albahli
In recent years, data are generated rapidly that advanced the evolving of the linked data. Modern data are globally distributed over the semantically linked graphs. The nature of the distributed data over the semantic graph raised new demands on further investigation on improving performance on the semantic graphs. In this work, we analyzed the time latency as an important factor to be further investigated and improved. We evaluated the parallel computing on these distributed data in order to better utilize the parallelism approaches. A federation framework based on a multi-threaded environment supporting federated SPARQL query was introduced. In our experiments, we show the achievability and effectiveness of our model on a set of real-world quires through real-world Linked Open Data cloud. Significant performance improvement has noticed. Further, we highlight short-comings that could open an avenue in the research of federated queries. Keywords: Semantic web; distributed query processing; query federation; linked data; join methods.
{"title":"Parallel-Based Techniques for Managing and Analyzing the Performance on Semantic Graph","authors":"A. Algosaibi, K. Ragab, Saleh Albahli","doi":"10.1142/s0129626420500073","DOIUrl":"https://doi.org/10.1142/s0129626420500073","url":null,"abstract":"In recent years, data are generated rapidly that advanced the evolving of the linked data. Modern data are globally distributed over the semantically linked graphs. The nature of the distributed data over the semantic graph raised new demands on further investigation on improving performance on the semantic graphs. In this work, we analyzed the time latency as an important factor to be further investigated and improved. We evaluated the parallel computing on these distributed data in order to better utilize the parallelism approaches. A federation framework based on a multi-threaded environment supporting federated SPARQL query was introduced. In our experiments, we show the achievability and effectiveness of our model on a set of real-world quires through real-world Linked Open Data cloud. Significant performance improvement has noticed. Further, we highlight short-comings that could open an avenue in the research of federated queries. Keywords: Semantic web; distributed query processing; query federation; linked data; join methods.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128097374","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}
Pub Date : 2020-06-01DOI: 10.1142/s0129626420500085
Sanjeev Saxena
In this paper, a parallel algorithm for all nearest smallers problem without using doubly logarithmic tree is described. It is shown that using only [Formula: see text] time routines for merging and prefix minima, we can easily get an [Formula: see text] time parallel algorithm for the all Nearest Smallers problem.
{"title":"All Nearest Smallers Made Simple","authors":"Sanjeev Saxena","doi":"10.1142/s0129626420500085","DOIUrl":"https://doi.org/10.1142/s0129626420500085","url":null,"abstract":"In this paper, a parallel algorithm for all nearest smallers problem without using doubly logarithmic tree is described. It is shown that using only [Formula: see text] time routines for merging and prefix minima, we can easily get an [Formula: see text] time parallel algorithm for the all Nearest Smallers problem.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124512312","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}
Let [Formula: see text] be a non-complete graph, a subset [Formula: see text] is called a [Formula: see text]-component cut of [Formula: see text], if [Formula: see text] is disconnected and has at least [Formula: see text] components. The cardinality of the minimum [Formula: see text]-component cut is the [Formula: see text]-component connectivity of [Formula: see text] and is denoted by [Formula: see text]. The [Formula: see text]-component connectivity is a natural extension of the classical connectivity. As an application, the [Formula: see text]-component connectivity can be used to evaluate the reliability and fault tolerance of an interconnection network structure based on a graph model. In a previous work, E. Cheng et al. obtained the [Formula: see text]-component connectivity of the generalized exchanged hypercube [Formula: see text] for [Formula: see text] and [Formula: see text]. In this paper, we continue the work and determine that [Formula: see text] for [Formula: see text]. Moreover, we show that every optimal [Formula: see text]-component cut of [Formula: see text] is trivial for [Formula: see text] and [Formula: see text].
设[Formula: see text]是一个非完全图，如果[Formula: see text]是不相连的，并且至少有[Formula: see text]个组件，则[Formula: see text]的子集[Formula: see text]被称为[Formula: see text]的[Formula: see text]组件切割。最小[公式:见文]-分量分割的基数是[公式:见文]的[公式:见文]-分量连通性，用[公式:见文]表示。组件连通性是经典连通性的自然延伸。作为一种应用，[公式:见文]-组件连通性可用于基于图模型的互连网络结构的可靠性和容错性评估。E. Cheng等人在之前的工作中得到了[公式:见文]和[公式:见文]的广义交换超立方体[公式:见文]的分量连通性[公式:见文]。在本文中，我们继续工作，并确定[公式:见文]为[公式:见文]。此外，我们还证明，对于[公式:见文本]和[公式:见文本]而言，[公式:见文本]的每个最优[公式:见文本]-组件切割都是微不足道的。
{"title":"Reliability Analysis of the Generalized Exchanged Hypercube","authors":"Qifan Zhang, Liqiong Xu, Weihua Yang, Shanshan Yin","doi":"10.1142/s0129626420500097","DOIUrl":"https://doi.org/10.1142/s0129626420500097","url":null,"abstract":"Let [Formula: see text] be a non-complete graph, a subset [Formula: see text] is called a [Formula: see text]-component cut of [Formula: see text], if [Formula: see text] is disconnected and has at least [Formula: see text] components. The cardinality of the minimum [Formula: see text]-component cut is the [Formula: see text]-component connectivity of [Formula: see text] and is denoted by [Formula: see text]. The [Formula: see text]-component connectivity is a natural extension of the classical connectivity. As an application, the [Formula: see text]-component connectivity can be used to evaluate the reliability and fault tolerance of an interconnection network structure based on a graph model. In a previous work, E. Cheng et al. obtained the [Formula: see text]-component connectivity of the generalized exchanged hypercube [Formula: see text] for [Formula: see text] and [Formula: see text]. In this paper, we continue the work and determine that [Formula: see text] for [Formula: see text]. Moreover, we show that every optimal [Formula: see text]-component cut of [Formula: see text] is trivial for [Formula: see text] and [Formula: see text].","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132745440","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}
Pub Date : 2020-05-15DOI: 10.1142/S0129626420500152
Vedran Novakovi'c
In this paper a vectorized algorithm for simultaneously computing up to eight singular value decompositions (SVDs, each of the form $A=USigma V^{ast}$) of real or complex matrices of order two is proposed. The algorithm extends to a batch of matrices of an arbitrary length $n$, that arises, for example, in the annihilation part of the parallel Kogbetliantz algorithm for the SVD of a square matrix of order $2n$. The SVD algorithm for a single matrix of order two is derived first. It scales, in most instances error-free, the input matrix $A$ such that its singular values $Sigma_{ii}$ cannot overflow whenever its elements are finite, and then computes the URV factorization of the scaled matrix, followed by the SVD of a non-negative upper-triangular middle factor. A vector-friendly data layout for the batch is then introduced, where the same-indexed elements of each of the input and the output matrices form vectors, and the algorithm's steps over such vectors are described. The vectorized approach is then shown to be about three times faster than processing each matrix in isolation, while slightly improving accuracy over the straightforward method for the $2times 2$ SVD.
本文提出了一种同时计算2阶实数或复数矩阵最多8个奇异值分解的矢量化算法，每个奇异值分解的形式为$ a =USigma V^{ast}$。该算法扩展到任意长度$n$的一批矩阵，例如，出现在并行Kogbetliantz算法的湮灭部分，用于求阶为$2n$的方阵的SVD。首先推导了单二阶矩阵的奇异值分解算法。在大多数情况下，它对输入矩阵$A$进行缩放，使其奇异值$Sigma_{ii}$在其元素有限时不会溢出，然后计算缩放后的矩阵的URV分解，然后计算非负上三角形中间因子的SVD。然后引入批处理的向量友好型数据布局，其中每个输入和输出矩阵的相同索引元素形成向量，并描述算法在这些向量上的步骤。然后，向量化方法被证明比单独处理每个矩阵快三倍左右，同时对$2 × 2$ SVD的精度略高于直接方法。
{"title":"Batched computation of the singular value decompositions of order two by the AVX-512 vectorization","authors":"Vedran Novakovi'c","doi":"10.1142/S0129626420500152","DOIUrl":"https://doi.org/10.1142/S0129626420500152","url":null,"abstract":"In this paper a vectorized algorithm for simultaneously computing up to eight singular value decompositions (SVDs, each of the form $A=USigma V^{ast}$) of real or complex matrices of order two is proposed. The algorithm extends to a batch of matrices of an arbitrary length $n$, that arises, for example, in the annihilation part of the parallel Kogbetliantz algorithm for the SVD of a square matrix of order $2n$. The SVD algorithm for a single matrix of order two is derived first. It scales, in most instances error-free, the input matrix $A$ such that its singular values $Sigma_{ii}$ cannot overflow whenever its elements are finite, and then computes the URV factorization of the scaled matrix, followed by the SVD of a non-negative upper-triangular middle factor. A vector-friendly data layout for the batch is then introduced, where the same-indexed elements of each of the input and the output matrices form vectors, and the algorithm's steps over such vectors are described. The vectorized approach is then shown to be about three times faster than processing each matrix in isolation, while slightly improving accuracy over the straightforward method for the $2times 2$ SVD.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134032432","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}
Pub Date : 2020-03-17DOI: 10.1142/s0129626420500012
Shuangshuang Zhang, Yuzhi Xiao, Xia Liu, J. Yin
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The s...
{"title":"A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs","authors":"Shuangshuang Zhang, Yuzhi Xiao, Xia Liu, J. Yin","doi":"10.1142/s0129626420500012","DOIUrl":"https://doi.org/10.1142/s0129626420500012","url":null,"abstract":"The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The s...","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130078824","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}
Pub Date : 2020-03-17DOI: 10.1142/s0129626420500036
Wantao Ning
Based on exchanged hypercube, a new interconnection network, exchanged folded hypercube, was proposed recently. It has better properties than other variations of hypercube in some areas. In this wo...
{"title":"The Connectivity of Exchanged Folded Hypercube","authors":"Wantao Ning","doi":"10.1142/s0129626420500036","DOIUrl":"https://doi.org/10.1142/s0129626420500036","url":null,"abstract":"Based on exchanged hypercube, a new interconnection network, exchanged folded hypercube, was proposed recently. It has better properties than other variations of hypercube in some areas. In this wo...","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126413255","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}
Pub Date : 2020-03-17DOI: 10.1142/s0129626420500048
Firmin Andzembe Okoubi, J. Koko
We study a parallel non-overlapping domain decomposition method, based on the Nesterov accelerated gradient descent, for the numerical approximation of elliptic partial differential equations. The ...
研究了一种基于Nesterov加速梯度下降的椭圆型偏微分方程的并行无重叠区域分解方法。…
{"title":"Parallel Nesterov Domain Decomposition Method for Elliptic Partial Differential Equations","authors":"Firmin Andzembe Okoubi, J. Koko","doi":"10.1142/s0129626420500048","DOIUrl":"https://doi.org/10.1142/s0129626420500048","url":null,"abstract":"We study a parallel non-overlapping domain decomposition method, based on the Nesterov accelerated gradient descent, for the numerical approximation of elliptic partial differential equations. The ...","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125191280","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}
Pub Date : 2020-03-01DOI: 10.1142/s0129626420500024
C. Fernandez, I. Vourkas, A. Rubio
To accelerate the execution of advanced computing tasks, in-memory computing with resistive memory provides a promising solution. In this context, networks of memristors could be used as parallel computing medium for the solution of complex optimization problems. Lately, the solution of the shortest-path problem (SPP) in a two-dimensional memristive grid has been given wide consideration. Some still open problems in such computing approach concern the time required for the grid to reach to a steady state, and the time required to read the result, stored in the state of a subset of memristors that represent the solution. This paper presents a circuit simulation-based performance assessment of memristor networks as SPP solvers. A previous methodology was extended to support weighted directed graphs. We tried memristor device models with fundamentally different switching behavior to check their suitability for such applications and the impact on the timely detection of the solution. Furthermore, the requirement of binary vs. analog operation of memristors was evaluated. Finally, the memristor network-based computing approach was compared to known algorithmic solutions to the SPP over a large set of random graphs of different sizes and topologies. Our results contribute to the proper development of bio-inspired memristor network-based SPP solvers.
{"title":"Shortest Path Computing in Directed Graphs with Weighted Edges Mapped on Random Networks of Memristors","authors":"C. Fernandez, I. Vourkas, A. Rubio","doi":"10.1142/s0129626420500024","DOIUrl":"https://doi.org/10.1142/s0129626420500024","url":null,"abstract":"To accelerate the execution of advanced computing tasks, in-memory computing with resistive memory provides a promising solution. In this context, networks of memristors could be used as parallel computing medium for the solution of complex optimization problems. Lately, the solution of the shortest-path problem (SPP) in a two-dimensional memristive grid has been given wide consideration. Some still open problems in such computing approach concern the time required for the grid to reach to a steady state, and the time required to read the result, stored in the state of a subset of memristors that represent the solution. This paper presents a circuit simulation-based performance assessment of memristor networks as SPP solvers. A previous methodology was extended to support weighted directed graphs. We tried memristor device models with fundamentally different switching behavior to check their suitability for such applications and the impact on the timely detection of the solution. Furthermore, the requirement of binary vs. analog operation of memristors was evaluated. Finally, the memristor network-based computing approach was compared to known algorithmic solutions to the SPP over a large set of random graphs of different sizes and topologies. Our results contribute to the proper development of bio-inspired memristor network-based SPP solvers.","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127017067","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}
Pub Date : 2019-12-08DOI: 10.1142/s0129626419500178
Shiying Wang, Mujiangshan Wang
Connectivity plays an important role in measuring the fault tolerance of interconnection networks. As a topology structure of interconnection networks, the m-ary n-dimensional hypercube HCnm has ma...
{"title":"A Note on the Connectivity of m-Ary n-Dimensional Hypercubes","authors":"Shiying Wang, Mujiangshan Wang","doi":"10.1142/s0129626419500178","DOIUrl":"https://doi.org/10.1142/s0129626419500178","url":null,"abstract":"Connectivity plays an important role in measuring the fault tolerance of interconnection networks. As a topology structure of interconnection networks, the m-ary n-dimensional hypercube HCnm has ma...","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130122227","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}
Pub Date : 2019-12-01DOI: 10.1142/s0129626419500154
Avah Banerjee, D. Richards
Sorting networks are a class of parallel oblivious sorting algorithms. Not only do they have interesting theoretical properties but they can be fabricated. A sorting network is a sequence of parall...
{"title":"A Sorting Network on Trees","authors":"Avah Banerjee, D. Richards","doi":"10.1142/s0129626419500154","DOIUrl":"https://doi.org/10.1142/s0129626419500154","url":null,"abstract":"Sorting networks are a class of parallel oblivious sorting algorithms. Not only do they have interesting theoretical properties but they can be fabricated. A sorting network is a sequence of parall...","PeriodicalId":422436,"journal":{"name":"Parallel Process. Lett.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127115464","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：