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

Parallel Process. Lett.最新文献

筛选
英文 中文
Parallel-Based Techniques for Managing and Analyzing the Performance on Semantic Graph 基于并行的语义图性能管理与分析技术
Parallel Process. Lett. Pub Date : 2020-06-01 DOI: 10.1142/s0129626420500073
A. Algosaibi, K. Ragab, Saleh Albahli
{"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}
引用次数: 1
All Nearest Smallers Made Simple 所有最近的小的变得简单
Parallel Process. Lett. Pub Date : 2020-06-01 DOI: 10.1142/s0129626420500085
Sanjeev Saxena
{"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}
引用次数: 0
Reliability Analysis of the Generalized Exchanged Hypercube 广义交换超立方体的可靠性分析
Parallel Process. Lett. Pub Date : 2020-06-01 DOI: 10.1142/s0129626420500097
Qifan Zhang, Liqiong Xu, Weihua Yang, Shanshan Yin
{"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}
引用次数: 0
Batched computation of the singular value decompositions of order two by the AVX-512 vectorization AVX-512矢量化的二阶奇异值分解的批量计算
Parallel Process. Lett. Pub Date : 2020-05-15 DOI: 10.1142/S0129626420500152
Vedran Novakovi'c
{"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}
引用次数: 4
A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs 一类排图的强匹配排除简记
Parallel Process. Lett. Pub Date : 2020-03-17 DOI: 10.1142/s0129626420500012
Shuangshuang Zhang, Yuzhi Xiao, Xia Liu, J. Yin
{"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}
引用次数: 0
The Connectivity of Exchanged Folded Hypercube 交换折叠超立方体的连通性
Parallel Process. Lett. Pub Date : 2020-03-17 DOI: 10.1142/s0129626420500036
Wantao Ning
{"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}
引用次数: 2
Parallel Nesterov Domain Decomposition Method for Elliptic Partial Differential Equations 椭圆型偏微分方程的平行Nesterov区域分解方法
Parallel Process. Lett. Pub Date : 2020-03-17 DOI: 10.1142/s0129626420500048
Firmin Andzembe Okoubi, J. Koko
{"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}
引用次数: 0
Shortest Path Computing in Directed Graphs with Weighted Edges Mapped on Random Networks of Memristors 随机忆阻器网络上加权边有向图的最短路径计算
Parallel Process. Lett. Pub Date : 2020-03-01 DOI: 10.1142/s0129626420500024
C. Fernandez, I. Vourkas, A. Rubio
{"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}
引用次数: 1
A Note on the Connectivity of m-Ary n-Dimensional Hypercubes 关于m-任意n维超立方体的连通性的一个注记
Parallel Process. Lett. Pub Date : 2019-12-08 DOI: 10.1142/s0129626419500178
Shiying Wang, Mujiangshan Wang
{"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}
引用次数: 0
A Sorting Network on Trees 树上的排序网络
Parallel Process. Lett. Pub Date : 2019-12-01 DOI: 10.1142/s0129626419500154
Avah Banerjee, D. Richards
{"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}
引用次数: 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学术官方微信