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

Parallel Algorithms and Applications最新文献

筛选
英文 中文
A LIBRARY FOR DOING POLYHEDRAL OPERATIONS 一个用于多面体运算的库
Parallel Algorithms and Applications Pub Date : 2000-12-01 DOI: 10.1080/01495730008947354
D. Wilde
{"title":"A LIBRARY FOR DOING POLYHEDRAL OPERATIONS","authors":"D. Wilde","doi":"10.1080/01495730008947354","DOIUrl":"https://doi.org/10.1080/01495730008947354","url":null,"abstract":"Abstract The design and implementation of a library of C-code procedures to perform operations on rational polyhedra is described. The library supports intersection, union, difference, simplification in context, convex hull, affine image, affine preimage, and computation of dual forms. Since not all of these functions are closed over polyhedra, the library is extended to operate on finite unions of polyhedra. The major design decisions made during the implementation of the library are discussed. The data structure used for representing finite unions of polyhedra is developed and validity rules for the representation of polyhedra are derived. And finally, the algorithms used to implement the various functions in the library are presented.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134180817","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}
引用次数: 240
DETECTION OF SCANS 扫描检测
Parallel Algorithms and Applications Pub Date : 2000-12-01 DOI: 10.1080/01495730008947357
Xavier Redon, P. Feautrier
{"title":"DETECTION OF SCANS","authors":"Xavier Redon, P. Feautrier","doi":"10.1080/01495730008947357","DOIUrl":"https://doi.org/10.1080/01495730008947357","url":null,"abstract":"Abstract Most automatic parallelizes are based on the detection of independent operations. Dependence analysis is mainly a syntactical process, in which the actual data transformations are ignored. There is another source of parallelism, which relies on semantical information, namely the detection of reductions and scans. Scans and reductions are quite frequent in scientific codes and are implemented efficiently on most parallel computers. We present here a new Scan detector which is based on the normalization of systems of recurrence equations. This allows the detection of scans in loops nests of arbitrary depth and on multi-dimensional arrays, and gives a uniform treatment for scalar reductions, array reductions, and arrays of reductions.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129569317","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}
引用次数: 14
REGULAR STATE MACHINES 常规状态机
Parallel Algorithms and Applications Pub Date : 2000-12-01 DOI: 10.1080/01495730008945375
L. Thiele, J. Teich, Karsten Strehl
{"title":"REGULAR STATE MACHINES","authors":"L. Thiele, J. Teich, Karsten Strehl","doi":"10.1080/01495730008945375","DOIUrl":"https://doi.org/10.1080/01495730008945375","url":null,"abstract":"Abstract In this paper, we introduce a model called regular state machines (RSMs) that characterizes a class of state transition systems with regular transition behavior. It turns out that many process graph models such as synchronous dataflow graphs and Petri nets have a state transition system that may be described and analyzed in the RSM model. In particular, the proposed approach unifies methods known for the above-mentioned subclasses and yields new results concerning boundedness, deadlocks, scheduling, and formal verification.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114350305","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
PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS 处理器时间最优收缩阵列
Parallel Algorithms and Applications Pub Date : 2000-12-01 DOI: 10.1080/01495730008947355
P. Cappello, Ö. Eğecioğlu, C. Scheiman
{"title":"PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS","authors":"P. Cappello, Ö. Eğecioğlu, C. Scheiman","doi":"10.1080/01495730008947355","DOIUrl":"https://doi.org/10.1080/01495730008947355","url":null,"abstract":"Abstract Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic graph (dag) model of algorithms is used to define a time-minimal schedule and a processor-time-minimal schedule, We present a technique for finding a lower bound on the number of processors needed to achieve a given schedule of an algorithm. The application of this technique is illustrated with a tensor product computation. We then apply the technique to the free schedule of algorithms for matrix product, Gaussian elimination, and transitive closure. For each, we provide a time-minimal processor schedule that meets these processor lower bounds, including the one for tensor product.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126319879","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}
引用次数: 7
Advanced Regular Array Design 高级正则阵列设计
Parallel Algorithms and Applications Pub Date : 2000-12-01 DOI: 10.1080/01495730008947353
T. Plaks
{"title":"Advanced Regular Array Design","authors":"T. Plaks","doi":"10.1080/01495730008947353","DOIUrl":"https://doi.org/10.1080/01495730008947353","url":null,"abstract":"","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132008266","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
MULTICRITERIA SORTING METHODOLOGY: APPLICATION TO FINANCIAL DECISION PROBLEMS 多标准分类方法:在财务决策问题中的应用
Parallel Algorithms and Applications Pub Date : 2000-06-01 DOI: 10.1080/01495730008947352
M. Doumpos, C. Zopounidis, P. Pardalos
{"title":"MULTICRITERIA SORTING METHODOLOGY: APPLICATION TO FINANCIAL DECISION PROBLEMS","authors":"M. Doumpos, C. Zopounidis, P. Pardalos","doi":"10.1080/01495730008947352","DOIUrl":"https://doi.org/10.1080/01495730008947352","url":null,"abstract":"Abstract The primary objective in the sorting approach is to assign a set of alternatives into predefined classes. This type of problem is often encountered in many real world decision problems. During the last two decades several new approaches have been proposed to overcome the shortcomings of traditional statistical and econometric techniques. This paper focuses on the multicriteria decision aid (MCDA) approach; it briefly reviews the main MCDA sorting techniques, and presents the multigroup hierarchical discrimination method. This new MCDA sorting technique is applied to the portfolio selection problem. A comparison with discriminant analysis is also performed. Furthermore, the efficiency of the proposal approach can be easily improved for solving large-scale problems in a multiprocessing environment.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"27 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":"116822249","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}
引用次数: 25
PARALLEL AND DISTRIBUTED EVOLUTIONARY COMPUTATION FOR FINANCIAL APPLICATIONS 金融应用的并行和分布式进化计算
Parallel Algorithms and Applications Pub Date : 2000-06-01 DOI: 10.1080/01495730008947348
B. Chopard, O. Pictet, M. Tomassini
{"title":"PARALLEL AND DISTRIBUTED EVOLUTIONARY COMPUTATION FOR FINANCIAL APPLICATIONS","authors":"B. Chopard, O. Pictet, M. Tomassini","doi":"10.1080/01495730008947348","DOIUrl":"https://doi.org/10.1080/01495730008947348","url":null,"abstract":"Abstract A survey of two parallel evolutionary computation techniques is presented: the genetic algorithms and genetic programming methods. An application of this approach to the induction of trading models is presented for financial assets, which is known as a hard problem. This study analyses the potential of this approach and the benefit of parallelization.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"9 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":"127805449","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}
引用次数: 11
PARALLEL PSEUDOSPECTRAL SOLUTION OF FINANCIAL PARTIAL DIFFERENTIAL EQUATIONS 金融偏微分方程的平行伪谱解
Parallel Algorithms and Applications Pub Date : 2000-06-01 DOI: 10.1080/01495730008947347
F. O. Bunnin, Yike Guo, Yuhe Ren, J. Darlington
{"title":"PARALLEL PSEUDOSPECTRAL SOLUTION OF FINANCIAL PARTIAL DIFFERENTIAL EQUATIONS","authors":"F. O. Bunnin, Yike Guo, Yuhe Ren, J. Darlington","doi":"10.1080/01495730008947347","DOIUrl":"https://doi.org/10.1080/01495730008947347","url":null,"abstract":"Abstract We apply the Pseudospectral method to two fundamental financial equations: the Black-Scholes equation and the Cox Ingersoil Ross model of the term structure of interest rates. The former is used to price a European Call Option and the latter to price a zero coupon bond. Chebyshev polynomials are used as the basis functions and Chebyshev collocation points for the space discretisation. The Crank-Nicolson scheme is used for the time differencing. We have developed a C++ program to solve general second order linear parabolic equations, A parallel quasi-minimal residual version of the Bi-Conjugate Gradient stabilised algorithm is applied to solve the linear system on the AP3000, a parallel computer. The regular space domain and the smooth solutions often encountered in finance suggest the suitability of using this higher order technique.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"4 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":"130770700","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
PARALLEL GIVENS SEQUENCES FOR SOLVING THE GENERAL LINEAR MODEL ON A EREW PRAM 并行给出了求解一个新程序上一般线性模型的序列
Parallel Algorithms and Applications Pub Date : 2000-06-01 DOI: 10.1080/01495730008947350
E. Kontoghiorghes
{"title":"PARALLEL GIVENS SEQUENCES FOR SOLVING THE GENERAL LINEAR MODEL ON A EREW PRAM","authors":"E. Kontoghiorghes","doi":"10.1080/01495730008947350","DOIUrl":"https://doi.org/10.1080/01495730008947350","url":null,"abstract":"Abstract Parallel Givens sequences for solving the General Linear Model (GLM) are developed and analyzed. The block updating GLM estimation problem is also considered. The solution of the GLM employs as a main computational device the Generalized QR Decomposition, where one of the two matrices is initially upper triangular. The proposed Givens sequences efficiently exploit the initial triangular structure of the matrix and special properties of the solution method. The complexity analysis of the sequences is based on a Exclusive Read-Exclusive Write (EREW) Parallel Random Access Machine (PRAM) model with limited parallelism. Furthermore, the number of operations performed by a Givens rotation is determined by the size of the vectors used in the rotation. With these assumptions one conclusion drawn is that a sequence which applies the smallest number of compound disjoint Givens rotations to solve the GLM estimation problem does not necessarily have the lowest computational complexity. The various Givens sequences and their computational complexity analyses will be useful when addressing the solution of other similar factorization problems.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"64 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":"126429646","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
SYSTEMATIC SYNTHESIS OF PARALLEL ARCHITECTURES FOR THE REAL-TIME ESTIMATION OF HIGHER ORDER STATISTICAL MOMENTS 用于高阶统计矩实时估计的并行结构的系统综合
Parallel Algorithms and Applications Pub Date : 2000-06-01 DOI: 10.1080/01495730008947351
E. Manolakos, H. M. Stellakis
{"title":"SYSTEMATIC SYNTHESIS OF PARALLEL ARCHITECTURES FOR THE REAL-TIME ESTIMATION OF HIGHER ORDER STATISTICAL MOMENTS","authors":"E. Manolakos, H. M. Stellakis","doi":"10.1080/01495730008947351","DOIUrl":"https://doi.org/10.1080/01495730008947351","url":null,"abstract":"Abstract The Higher Order Statistics, such as the Higher Order Moments, Cumulants and Polyspectra, have been recognized as important tools in modem time series analysis since they overcome well-known limitations of the autocorrelation/power spectrum second order methods. The systematic synthesis of parallel algorithms and architectures for the real-time estimation of moments up to any desirable maximal order k > 3 is presented. First, a design methodology is developed which can take into account the desirable characteristics of the targeted parallel architecture and used to construct an optimal locally recursive form of the algorithm amenable to efficient parallelization. The design methodology is then used to synthesize a family of algorithms and minimum latency, low granularity, processor array architectures that can compute all lags of Higher Order Moments, from the samples of the incoming data sequence in real-time.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"31 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":"126536778","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信