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

Parallel Algorithms and Applications最新文献

筛选
英文 中文
Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation 利用位操作为图形顶点着色的并行算法
Parallel Algorithms and Applications Pub Date : 2003-12-01 DOI: 10.1080/10637190310001633664
Neelam Bhalla
{"title":"Parallel Algorithms for Colouring Vertices of Graph Using Bit Manipulation","authors":"Neelam Bhalla","doi":"10.1080/10637190310001633664","DOIUrl":"https://doi.org/10.1080/10637190310001633664","url":null,"abstract":"Mathematicians for the past two decades have addressed the problem of colouring graph vertices purely as an academic interest. Recently, it has drawn the attention of computer scientists as many resource allocation problems in computers are being modelled as graph colouring problem. Since, the problem of colouring graph vertices is known to be NP-complete, frequently, one has to resort to near-optimal solution. In this paper, we present an efficient scheme that partitions the vertices of a graph into k colour classes using logical operations on bit vectors. The algorithms based on largest and smallest vertex remaining degree are presented. These are extended using heuristics based on Min/Max principal. The algorithms have inherent parallelism and are implemented on loosely coupled parallel computer. Using bit manipulation, it takes a few seconds to obtain near-optimal solution to colour graphs with 200 vertices. It is also observed that one of the four algorithms presented gives optimal solution. The parallel algorithms have linear speedup.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131517506","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
Cost-optimal Gaussian Elimination Algorithm on RCC-FULL 基于RCC-FULL的成本最优高斯消去算法
Parallel Algorithms and Applications Pub Date : 2003-12-01 DOI: 10.1080/10637190310001633646
A. Vyas, R. Maloo, P. Gupta
{"title":"Cost-optimal Gaussian Elimination Algorithm on RCC-FULL","authors":"A. Vyas, R. Maloo, P. Gupta","doi":"10.1080/10637190310001633646","DOIUrl":"https://doi.org/10.1080/10637190310001633646","url":null,"abstract":"This paper presents a cost-optimal parallel algorithm to find the solution of n simultaneous linear equations on RCC-FULL λ(N, L) network. The algorithm is designed following the strategy of the sequential Gaussian Elimination algorithm. The algorithm utilizes strength of the RCC-FULL network which helps to reduce the time complexity and has the time complexity of O(n) with O(n 2) processors.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124723582","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
Network computing performance evaluation in message passing environment 消息传递环境下的网络计算性能评价
Parallel Algorithms and Applications Pub Date : 2003-12-01 DOI: 10.1080/10637190310001639767
Qingping Guo, Y. Paker, D. Parkinson, Jinsheng Xiao
{"title":"Network computing performance evaluation in message passing environment","authors":"Qingping Guo, Y. Paker, D. Parkinson, Jinsheng Xiao","doi":"10.1080/10637190310001639767","DOIUrl":"https://doi.org/10.1080/10637190310001639767","url":null,"abstract":"This paper is based on joint research between Queen Mary, University of London, and Wuhan University of Technology, People's Republic of China, on the use of network computing for solving non-linear heat flow problems. A general formulation for system performance evaluation has been derived from measured results, which covers the network computing as well as multiprocessor computing. The Amdahl's law and Gustafson's modification for speedup have been uniformly explained from this formula. Some criterions of speedup, efficiency and granularity for network computing also have been suggested.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116867543","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
An experiment of parallel SPECT data reconstruction 并行SPECT数据重建实验
Parallel Algorithms and Applications Pub Date : 2003-09-01 DOI: 10.1080/1063719032000115335
E. L. Piccolomini, F. Zama
{"title":"An experiment of parallel SPECT data reconstruction","authors":"E. L. Piccolomini, F. Zama","doi":"10.1080/1063719032000115335","DOIUrl":"https://doi.org/10.1080/1063719032000115335","url":null,"abstract":"In this work we use a massively parallel architecture for solving the problem of reconstructing human brain sections from experimental data obtained from a Gamma camera equipped with parallel-hole collimators. We compute least-squares regularized solutions by means of weighted conjugate gradient iterations coupled with a suitable stopping rule. The computations are distributed to the CRAY T3E parallel processors following two different decomposition strategies obtaining high speed up values. This decomposition strategy can be easily extended to a wide family of iterative reconstruction algebraic methods.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114329400","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 algorithms for a multi-level network optimization problem 一个多级网络优化问题的并行算法
Parallel Algorithms and Applications Pub Date : 2003-09-01 DOI: 10.1080/10637190310001603630
F. Cruz, G. Mateus
{"title":"Parallel algorithms for a multi-level network optimization problem","authors":"F. Cruz, G. Mateus","doi":"10.1080/10637190310001603630","DOIUrl":"https://doi.org/10.1080/10637190310001603630","url":null,"abstract":"Multi-level network optimization (MLNO) problems arise in many contexts such as telecommunication, transportation, or electric power systems. This paper is mainly concerned with parallel implementations of the classical branch-and-bound algorithm for multi-level network design. A model for such a problem is presented and formulated as a mixed-integer program. The formulation is appealing because it integrates in the same model aspects of discrete facility location, topological network design, and dimensioning. We propose implementations that are suitable for multiple instruction stream, multiple data stream (MIMD) parallel computation systems. Thus, the implementations are very convenient for use in networks of workstations, which nowadays has become so popular. We have tested two versions of the branch-and-bound algorithm as well as different load balancing strategies. The results are very encouraging indicating a gain over sequential computations in terms of execution time.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128036323","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
Special Issue: New parallel algorithm and its speed-up for the explicit difference method 特刊:新的并行算法及其显式差分法的加速
Parallel Algorithms and Applications Pub Date : 2003-05-01 DOI: 10.1080/1063719031000088030
P. Purcz
{"title":"Special Issue: New parallel algorithm and its speed-up for the explicit difference method","authors":"P. Purcz","doi":"10.1080/1063719031000088030","DOIUrl":"https://doi.org/10.1080/1063719031000088030","url":null,"abstract":"New parallel “ring” algorithm for solution of a spatially one dimensional initial-boundary-value problem (IBVP) for a parabolic equation using an explicit difference method in this article is suggested. The parallel algorithm has been verified by implementation on a workstation-cluster running under parallel virtual machine (PVM). A speed-up function is determined as a ratio of time needed for realization of the algorithm in sequential case to time in parallel. Theoretical estimates of the speed-up function show the significant speed-up of the parallel algorithm in comparison with the serial one.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117043684","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 problem of small and large matrices in parallel Matrix Multiplication 并行矩阵乘法中大小矩阵的问题
Parallel Algorithms and Applications Pub Date : 2003-05-01 DOI: 10.1080/1063719031000087996
C. Piano
{"title":"The problem of small and large matrices in parallel Matrix Multiplication","authors":"C. Piano","doi":"10.1080/1063719031000087996","DOIUrl":"https://doi.org/10.1080/1063719031000087996","url":null,"abstract":"In this paper we discuss the case in which, using the generalized Cannon's algorithm, it is possible to reduce communications in matrix multiplication. We then apply reduction of communications to the case in which we have to multiply large matrices, in particular rectangular matrices. Two strategies are proposed to solve the problem of multiplying two large squared matrices. For the case in which we have to deal with small matrices, some methods are proposed to use the entire number of processors.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124116887","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
Special Issue: Node-to-Node Distances in Regular d-Neighbours Topologies 特刊:规则d邻居拓扑中的节点到节点距离
Parallel Algorithms and Applications Pub Date : 2003-05-01 DOI: 10.1080/1063719031000087987
R. Trobec, Uros Jovanovic
{"title":"Special Issue: Node-to-Node Distances in Regular d-Neighbours Topologies","authors":"R. Trobec, Uros Jovanovic","doi":"10.1080/1063719031000087987","DOIUrl":"https://doi.org/10.1080/1063719031000087987","url":null,"abstract":"The comparison of maximal and average node-to-node distances in recently introduced d-meshes, popular k-ary n-cubes, and more theoretical but in some cases near optimal permutation graphs is presented in this paper. The d-meshes are an extended family of two-dimensional regular meshes of an arbitrary degree d. They have the shortest maximal and average node-to-node distances, can be expanded in finer steps than both other topologies, and finally, d-meshes can be implemented on parallel planes carrying only parallel links.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123585542","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
Integration of load balancing in a CORBA environment 在CORBA环境中集成负载平衡
Parallel Algorithms and Applications Pub Date : 2003-05-01 DOI: 10.1080/1063719031000087978
J. Mocnik, R. Trobec, B. Robic
{"title":"Integration of load balancing in a CORBA environment","authors":"J. Mocnik, R. Trobec, B. Robic","doi":"10.1080/1063719031000087978","DOIUrl":"https://doi.org/10.1080/1063719031000087978","url":null,"abstract":"A framework for the distribution of program objects in heterogeneous computer systems using Common Object Request Broker Architecture (CORBA) is described. Any load balancing algorithm can be integrated transparently into the existing CORBA infrastructure. The implementation was tested with different load balancing strategies on an algorithm performing an exhaustive search over all possible paths, over all interconnection topologies of n nodes. The goal is to find the topology yielding the minimal sum of average and maximal distances among all pairs of nodes in minimal execution time.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127336106","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
An evaluation of adaptive numerical integration algorithms on parallel systems 并行系统自适应数值积分算法的评价
Parallel Algorithms and Applications Pub Date : 2003-05-01 DOI: 10.1080/1063719031000088012
Rudolf Schürer, A. Uhl
{"title":"An evaluation of adaptive numerical integration algorithms on parallel systems","authors":"Rudolf Schürer, A. Uhl","doi":"10.1080/1063719031000088012","DOIUrl":"https://doi.org/10.1080/1063719031000088012","url":null,"abstract":"Parallel adaptive algorithms for the approximation of a multi-dimensional integral over an hyper-rectangular region are described. Algorithms with centralized global region collection are compared to algorithms using local region collections. The latter algorithms should result in better scalability since global communication is avoided. Both types of algorithms are compared to quasi-Monte Carlo integration. Tests are performed using Genz's test functions and speed-up results are given.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116525489","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}
引用次数: 12
首页 上一页 下一页 尾页
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学术官方微信