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

Parallel Algorithms and Applications最新文献

筛选
英文 中文
MINING TAXATION DATA WITH PARALLEL BMARS 利用并行矩阵挖掘税收数据
Parallel Algorithms and Applications Pub Date : 2000-06-01 DOI: 10.1080/01495730008947349
S. Bakin, M. Hegland, Graham J. Williams
{"title":"MINING TAXATION DATA WITH PARALLEL BMARS","authors":"S. Bakin, M. Hegland, Graham J. Williams","doi":"10.1080/01495730008947349","DOIUrl":"https://doi.org/10.1080/01495730008947349","url":null,"abstract":"Abstract A new parallel version of Friedman's Multivariate Adaptive Regression Splines (MARS) algorithm is discussed. By partitioning the data over the processors of a parallel computational system one achieves good parallel efficiency. Instead of using truncated power basis functions of the original MARS, the new method (BMARS) utilises B-sp!ines which improves numerical stability and reduces the computational cost of the procedure. In addition, the coefficients of the basis functions of a BMARS model provide quickly accessible information about the local behaviour of the function. The algorithm has a time complexity proportional to the number of data records. The method provides a new means for the detection of areas in the space of features which are characterised by the \"interesting\" patterns of response values. This is applied to searching for classes of incorrect tax returns using multiple predictor variables or features. The parallel algorithm makes it feasible to investigate very large databases, such as the taxation database.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114980433","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}
引用次数: 6
Fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system* 具有可重构流水线总线系统的线性阵列容错算法*
Parallel Algorithms and Applications Pub Date : 2000-05-01 DOI: 10.1080/1063719031000104996
A. Bourgeois, J. Trahan
{"title":"Fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system*","authors":"A. Bourgeois, J. Trahan","doi":"10.1080/1063719031000104996","DOIUrl":"https://doi.org/10.1080/1063719031000104996","url":null,"abstract":"Recently, researchers have proposed many models using reconfigurable optically pipelined buses. All algorithms developed for these models assume that a healthy system is available. We present some fundamental algorithms that are able to tolerate up to N/2 faults on an N-processor, linear array with a reconfigurable pipelined bus system (LARPBS) (one particular optical model). We then extend these results to apply to other algorithms in the areas of image processing and matrix operations.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125164859","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}
引用次数: 8
ANALYSIS OF DIFFERENT PARTITIONING SCHEMES FOR PARALLEL GRAM-SCHMIDT ALGORITHMS 并行gram-schmidt算法的不同划分方案分析
Parallel Algorithms and Applications Pub Date : 2000-04-01 DOI: 10.1080/10637199808947392
S. Oliveira, L. Borges, M. Holzrichter, T. Soma
{"title":"ANALYSIS OF DIFFERENT PARTITIONING SCHEMES FOR PARALLEL GRAM-SCHMIDT ALGORITHMS","authors":"S. Oliveira, L. Borges, M. Holzrichter, T. Soma","doi":"10.1080/10637199808947392","DOIUrl":"https://doi.org/10.1080/10637199808947392","url":null,"abstract":"In this paper we analyze implementations of parallel Gram-Schmidt orthogonalization algorithms. One of the first parallel orthogonalization of Gram-Schmidt was the row-wise partitioning of O'Leary and Whitman. In this paper we describe a pipelined implementation which uses column-wise partitioning schemes. Timing models for the column-wise parallel algorithms are derived. We compare our column-wise partitionings against the row-wise partitioning and validate our study with computational results. The pipelined orthogonalization algorithm is important because the timing analysis is independent of the architecture model. Threshold values of m max, which is the number of rows where row partitioning becomes better than column partitioning are found theoretically and verified with our experiments","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116231865","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}
引用次数: 10
UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS 产品网络上高斯消去的倒代统一并行算法
Parallel Algorithms and Applications Pub Date : 2000-04-01 DOI: 10.1080/10637199808947390
A. Al-Ayyoub, K. Day
{"title":"UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS","authors":"A. Al-Ayyoub, K. Day","doi":"10.1080/10637199808947390","DOIUrl":"https://doi.org/10.1080/10637199808947390","url":null,"abstract":"The increasing interest in product networks (PNs) as a method of combining desirable properties of component networks, has prompted a need for the general study of the algorithmic issues related to this important class of interconnection networks. In this paper we present unified parallel algorithms for Gaussian elimination, with partial and complete pivoting, on product networks. A parallel algorithm for backward substitution is also presented. The proposed algorithms are network independent and are also independent of the matrix distribution methods employed. These algorithms can be used on a wide range of PNs including hypercube, mesh, and k-ary n-cube. Unified models for estimating computation time and interprocessor communication time are also presented. These models are then used to measure the performance of the proposed algorithms on several product networks","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129907427","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
IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH 基于深度优先搜索的最大匹配改进并行算法
Parallel Algorithms and Applications Pub Date : 2000-04-01 DOI: 10.1080/10637199808947393
A. K. Datta, R. Sen
{"title":"IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH","authors":"A. K. Datta, R. Sen","doi":"10.1080/10637199808947393","DOIUrl":"https://doi.org/10.1080/10637199808947393","url":null,"abstract":"Computation of maximal matching of a graph based on Depth First Search tree computation was introduced by Datta and Sen (Parallel Algorithms and Applications, 5, 1995, 161-164). They showed that the approach gives efficient parallel algorithms for maximal matching for graphs for which DFS tree can be efficiently computed. They also presented a parallel scheme to compute a maximal matching in O(T(n) log n) time using O(P(n)) number of processors, where T(n) and P(n) are the time and the number of processors required to compute DFS tree of a graph in parallel. We present here, an improved technique to compute maximal matching in parallel based on DFS tree computation. The algorithm takes O(T(n)) time and O(P(n)) processors.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"127 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120818363","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
AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS* 开发bsp风格程序的公理框架*
Parallel Algorithms and Applications Pub Date : 2000-04-01 DOI: 10.1080/10637199808947391
A. Stewart, M. Clint, J. Gabarró
{"title":"AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS*","authors":"A. Stewart, M. Clint, J. Gabarró","doi":"10.1080/10637199808947391","DOIUrl":"https://doi.org/10.1080/10637199808947391","url":null,"abstract":"In bulk-synchronous parallel (BSP) computation a superstep comprises a collection of concurrently executed processes with initial and terminal synchronisations. Data transfer between processes is realised through asynchronous communications. BSP programs can be organised either as explicit compositions of supersteps or as parallel compositions of threads (processes) which include synchronisation alignment operations. In this paper axiomatic semantics for the two approaches are proposed: in both cases the semantics are based on a new form of multiple substitution - predicate substitution which generalises previous definitions of substitution. Predicate substitution together with global synchronisation provide a means of linking state based and process semantics of BSP. Features of both models are illustrated through correctness proofs of matrix multiplication programs","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124875337","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}
引用次数: 13
PARALLEL SOLVERS FOR PLANAR ELLIPTIC GRID GENERATION EQUATIONS 平面椭圆网格生成方程的并行求解器
Parallel Algorithms and Applications Pub Date : 2000-01-01 DOI: 10.1080/10637199808947385
W. L. Golik
{"title":"PARALLEL SOLVERS FOR PLANAR ELLIPTIC GRID GENERATION EQUATIONS","authors":"W. L. Golik","doi":"10.1080/10637199808947385","DOIUrl":"https://doi.org/10.1080/10637199808947385","url":null,"abstract":"Numerical solution of elliptic grid generation equations requires iterative solution of large nonlinear algebraic systems, a computationally intensive task. To assist a selection of efficient and robust methods, this paper considers parallel implementations of several iterative grid generation solvers. The methods studied are multicolor SOR. multigrid, and GMRES. They are implemented on the MasPar MP-I, a massively parallel SIMD machine. The experiments suggest that multigrid methods are the most efficient and robust for large problems.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123040874","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
A PARALLEL ALGORITHM FOR BANDED LINEAR SYSTEM 带状线性系统的并行算法
Parallel Algorithms and Applications Pub Date : 2000-01-01 DOI: 10.1080/10637199808947389
S. Rao, P. Dutt, M. K. Kadalbajoo
{"title":"A PARALLEL ALGORITHM FOR BANDED LINEAR SYSTEM","authors":"S. Rao, P. Dutt, M. K. Kadalbajoo","doi":"10.1080/10637199808947389","DOIUrl":"https://doi.org/10.1080/10637199808947389","url":null,"abstract":"A direct parallel method called Alternate Quadrant Interlocking Factorization (AQIF); A = WZ, is introduced (Rao, Parallel Algorithms and Applications, 4, 1-20, 1994) for the general solution of the linear system Ax = b. The matrices W and Z are closed under multiplication and inversion. In this paper AQIF is used with partition method for the solution of the banded linear system. The AQIF of the coefficient matrix in each block has the properties that when A is banded with the semibandwidth β, the space generated by ei, en−I+1 1≤i≤β, is invariant under the transformation W, so is invariant under the transformation W −1, where ej denotes n dimensional unit vector with I in jth position and 0's elsewhere and the solution process with the coefficient matrix Z proceeds from the first and last unknowns towards middle ones. These properties of AQIF help us to decouple the partitioned systems for the parallel execution once ‘reduced system’ is solved.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126594554","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
THE METHOD OF MOMENTS FOR ELECTROMAGNETIC TRANSIENTS IN GROUNDING SYSTEMS ON DISTRIBUTED MEMORY MULTIPROCESSORS 分布式存储多处理机接地系统电磁瞬变矩量的计算方法
Parallel Algorithms and Applications Pub Date : 2000-01-01 DOI: 10.1080/10637199808947388
G. Ala, E. Francomano, A. Tortorici
{"title":"THE METHOD OF MOMENTS FOR ELECTROMAGNETIC TRANSIENTS IN GROUNDING SYSTEMS ON DISTRIBUTED MEMORY MULTIPROCESSORS","authors":"G. Ala, E. Francomano, A. Tortorici","doi":"10.1080/10637199808947388","DOIUrl":"https://doi.org/10.1080/10637199808947388","url":null,"abstract":"In this paper, the authors present an electromagnetic model suitable to investigate transient performance of electric power substations grounding systems, working in a distributed programming environment. The numerical model, represented by a modified version of the electric field integral equation in frequency domain, is solved by means of the method of moments according to the direct and the iterative numerical formulations. The two computational schemes are described and solved by means or parallel solutions differently grained and oriented to distributed memory computers. Test results, which illustrate the capability of the proposed schemes, are reported and the performances are assessed by using the 128-node Cray T3D architecture.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"58 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132531332","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}
引用次数: 8
EFFICIENT PARALLEL ALGORITHMS FOR THE LIS AND LCS PROBLEMS ON BSR MODEL USING CONSTANT NUMBER OF SELECTIONS 基于等量选择的BSR模型中lis和LCS问题的高效并行算法
Parallel Algorithms and Applications Pub Date : 2000-01-01 DOI: 10.1080/10637199808947386
J. Myoupo, D. Semé
{"title":"EFFICIENT PARALLEL ALGORITHMS FOR THE LIS AND LCS PROBLEMS ON BSR MODEL USING CONSTANT NUMBER OF SELECTIONS","authors":"J. Myoupo, D. Semé","doi":"10.1080/10637199808947386","DOIUrl":"https://doi.org/10.1080/10637199808947386","url":null,"abstract":"Recently Akl et al. introduced a new model of parallel computation, called BSR (broadcasting with selective reduction) and showed that it is more powerful than any CRCW PRAM and yet requires no more resources for implementation than even EREW PRAM. The model allows constant time solutions to sorting, parallel prefix and other problems. In this paper, we describe constant time solution to the longest common subsequence (LCS) and longest increasing subsequence (LIS) problems using the BSR model. The number of processors used to solve the LCS problem is O(N × M) (where N and M are the length of the two input sequences). Our BSR solution of the LIS problem needs O(N) processors (where N is the length of the input sequence). These two solutions use BSR instructions with a constant number of selections. It is an improvement of our former BSR algorithm for the LCS in (Journal of Parallel and Distributed Computing, to appear) which uses 3N + 3 selections.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133560186","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}
引用次数: 5
首页 上一页 下一页 尾页
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学术官方微信