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

Proceedings. International Conference on Parallel Computing in Electrical Engineering最新文献

筛选
英文 中文
An approach to parallelizing non-uniform loops with the Omega calculator 用欧米茄计算器并行化非均匀循环的方法
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115216
V. Beletskyy, R. Drazkowski, Marcin Liersz
{"title":"An approach to parallelizing non-uniform loops with the Omega calculator","authors":"V. Beletskyy, R. Drazkowski, Marcin Liersz","doi":"10.1109/PCEE.2002.1115216","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115216","url":null,"abstract":"An approach permitting loops with non-uniform dependences to be parallelized is presented. It does not require loop-carried dependences to be uniformized. Firstly, all the loop iterations are executed in parallel despite the presence of loop carried dependences, next all the sinks of the pairs of dependent iterations are re-executed to get correct results. A modification of this approach divides the iteration space into two sets. The first one includes independent iterations as well as all the sources of the pairs of dependent iterations that simultaneously are not the sinks of those. All iterations of this set can be executed in parallel. The second set holds all the sinks of the pairs of dependent iterations. The iterations of this set must be executed serially in lexicographical order. The approaches proposed have been implemented by means of the Omega calculator. Experimental results illustrate the scope of the approaches applicability.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116216581","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
Flood modeling system and its parallelization 洪水建模系统及其并行化
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115268
L. Hluchý, V. Tran, J. Astalos, M. Dobrucký, Giang T. Nguyen, D. Froehlich
{"title":"Flood modeling system and its parallelization","authors":"L. Hluchý, V. Tran, J. Astalos, M. Dobrucký, Giang T. Nguyen, D. Froehlich","doi":"10.1109/PCEE.2002.1115268","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115268","url":null,"abstract":"Flood modeling is a complex problem that requires cooperation of many scientists in different areas. In this paper, the architecture and results of ANFAS (Data Fusion for Flood Analysis and Decision Support) project is presented. This paper also focuses on parallel numerical solutions of the flood modeling module, the most computationally intensive part of the whole ANFAS architecture.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116217852","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 efficient hierarchical algorithms for module placement of large chips on distributed memory architectures 分布式存储架构中大型芯片模块放置的并行高效分层算法
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115310
L. Yang
{"title":"Parallel efficient hierarchical algorithms for module placement of large chips on distributed memory architectures","authors":"L. Yang","doi":"10.1109/PCEE.2002.1115310","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115310","url":null,"abstract":"The PROUD module placement algorithm mainly uses a hierarchical decomposition technique and the solution of sparse linear systems based on a resistive network analogy. It has been shown that the PROUD algorithm can achieve a comparable design of the placement problems for very large circuits with the best placement algorithm based on simulated annealing, but with several order of magnitude faster. The modified PROUD, namely MPROUD algorithm by perturbing the coefficient matrices performs much faster that the original PROUD algorithm. Due to the instability and unguaranteed convergence of MPROUD algorithm, we have proposed a new convergent and numerically stable PROUD, namely Improved PROUD algorithm, denoted as IPROUD with attractive computational costs to solve the module placement problems by making use of the SYMMLQ and MINRES methods based on Lanczos process (Yang, 1997). We subsequently propose parallel versions of the improved PROUD algorithms. The parallel algorithm is derived such that all inner products and matrix-vector multiplications of a single iteration step are independent. Therefore, the cost of global communication which represents the bottleneck of the parallel performance on parallel distributed memory computers can be significantly reduced, therefore, to obtain another order of magnitude improvement in the runtime without loss of the quality of the layout.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115343343","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 survey of speculative methods for transient state analysis 暂态分析的推测方法综述
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115292
J. Forenc, A. Jordan, M. Tudruj
{"title":"A survey of speculative methods for transient state analysis","authors":"J. Forenc, A. Jordan, M. Tudruj","doi":"10.1109/PCEE.2002.1115292","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115292","url":null,"abstract":"The article presents two types of the speculative methods: the speculative method with a fixed integration step, and the speculative method with a variable integration step. These methods are an original approach to the transient states analysis appearing in the physical and electrical systems, in which the transient state is described by a large system of ordinary differential equations, linear or nonlinear. A general idea of these methods is based on decomposition of the total time of transient analysis into subintervals in which computations are conducted in parallel. The application of speculative methods allows one to reduce the time of computations in relation to commonly used sequential algorithms. As an example of the application of speculative methods, the analysis of transient state described by a system of 10 differential equations is presented.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124709841","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
Parallel schemes of computation for Bernstein coefficients and their application 伯恩斯坦系数的并行计算格式及其应用
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115288
Z. Garczarczyk
{"title":"Parallel schemes of computation for Bernstein coefficients and their application","authors":"Z. Garczarczyk","doi":"10.1109/PCEE.2002.1115288","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115288","url":null,"abstract":"In the note we have established an approach to the range evaluation of a function over an interval. That problem is related to solving nonlinear system of algebraic equations with use of interval analysis techniques. Ranges of values of the nonlinear functions are approximated by coefficients of Bernstein polynomials. We have derived that coefficients of Bernstein polynomials are effectively calculated in some parallel process. We have used this approach in the algorithm for obtaining all solutions of nonlinear equations. The algorithm is based on box-bisection interval searching. Numerical studies are also reported in order to verify presented algorithm.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122948502","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}
引用次数: 9
The speculative method of transient state analysis with a variable integration step 变积分步长暂态分析的推测方法
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115298
J. Forenc
{"title":"The speculative method of transient state analysis with a variable integration step","authors":"J. Forenc","doi":"10.1109/PCEE.2002.1115298","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115298","url":null,"abstract":"In the article the speculative method of the analysis of transient states appearing in systems described by a large system of linear or nonlinear ordinary differential equations is presented. This method is based on decomposition of the total time of the transient analysis on a given number of subintervals, in which computations are conducted in parallel with the use of one of wellknown numerical methods of solving ordinary differential equations system. In previous papers (2001) the application of the fourth-order Runge-Kutta method with a fixed integration step was presented. In this paper the application of the same method, but with a variable integration step, is shown. The change of the method allows one to reduce the time of computations, but requires a new method of determination of initial conditions in particular subintervals and a new method of division of the total time of transient state analysis to be worked out. As an example of application, the analysis of dynamics of an asynchronous slip-ring motor is presented.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123535663","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
Computation-intensive image processing algorithm parallelization on multiple hardware architectures 多硬件架构上计算密集型图像处理算法并行化
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115341
A. Niedzicka
{"title":"Computation-intensive image processing algorithm parallelization on multiple hardware architectures","authors":"A. Niedzicka","doi":"10.1109/PCEE.2002.1115341","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115341","url":null,"abstract":"Image processing hardware found in workstations and server-like computers varies from single processor units to SMP or SMP/SMT configurations and sometimes DMP or massively parallel environments. Image processing can often benefit from introducing parallelism, thus improving owner's return on investment. However, the cost of sharing data between execution resources-and gathering results-can be prohibitively high when speed of simple convolution or arithmetic operation is taken into account. Often a single processor is much faster than available memory, bandwidth, making workload decomposition pointless. Non-logarithmic block matching is an algorithm that can be challenging even for the fastest processors, while being useful in high quality compression and picture enhancement or image recognition algorithms. Thanks to high granularity of operations and very few shared resources, careful implementation of the block matching algorithm is ideal for parallel execution.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124189995","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
The anatomy of a mobile agent information system for dynamic environments 动态环境下移动代理信息系统的剖析
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115254
D. Grigoras, C. Mulcahy, Rosanna McInerney
{"title":"The anatomy of a mobile agent information system for dynamic environments","authors":"D. Grigoras, C. Mulcahy, Rosanna McInerney","doi":"10.1109/PCEE.2002.1115254","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115254","url":null,"abstract":"In a dynamic environment it is often desirable to discover resources and services that can meet computing requirements of mobile users and devices. Currently, mobility benefits only on content delivery and limited access to remote computing. However, dynamic fast arising applications, extreme environments, or the search for certain tools, resources or services request the presence of an effective information system. Our approach is a mobile agent information system, called MAIS, that includes discovery, information collecting and reservation. MAIS allows a user working in a dynamic environment to start the procedure for discovering the necessary resources and services in order to create a dynamic cluster. When the computing need disappears, resources and services are released.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125155308","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 procedures for ROI identification in endoscopic images 内窥镜图像中ROI识别的平行程序
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115340
J. Saif, H. Krawczyk
{"title":"Parallel procedures for ROI identification in endoscopic images","authors":"J. Saif, H. Krawczyk","doi":"10.1109/PCEE.2002.1115340","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115340","url":null,"abstract":"The region of interest (ROI) matching problem is defined and its application to endoscopic diagnosis is shown. Two kinds of matching procedures are considered: random search and simulation annealing ones. The suitable sequential and parallel algorithms are proposed and their suitability for ROI identification is discussed.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125578547","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
Concurrent hardware/software coverification with Java threads 并发硬件/软件与Java线程的融合
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115211
M. Azizi
{"title":"Concurrent hardware/software coverification with Java threads","authors":"M. Azizi","doi":"10.1109/PCEE.2002.1115211","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115211","url":null,"abstract":"We present how Java threads are used to do concurrent coverification. The threads are scheduled with respect to the order of their priorities in the case of different priorities and by using the Round-Robin technique in the case of equal priorities. The system under coverification we are interested in consists eventually of a number of hardware and software modules described by threads at the behavioral level. The coverification process follows the execution path of the global modeled system and it verifies some specification properties during the simulation. We also discuss the case of untimed and timed coverification. An illustrative application on the broadcasting protocol of cache coherence reveals promising results.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130180571","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学术官方微信