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

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

筛选
英文 中文
Failure transparency in CORBA systems CORBA系统中的故障透明性
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115249
Grzegorz Skrzypczynski
{"title":"Failure transparency in CORBA systems","authors":"Grzegorz Skrzypczynski","doi":"10.1109/PCEE.2002.1115249","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115249","url":null,"abstract":"While building CORBA systems there is a need to hide object failures. In the article a solution based on a dynamic proxy pattern is presented. It is suitable for transient and persistent objects. Also the main architecture of systems in which it can be used is discussed.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"164 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":"121286618","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
Amelia-integrated environment for distributed processing 分布式处理的amelia集成环境
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115226
J. Kwiatkowski, Daniel Brozek, K. Czarnacki, M. Krotkiewski, Gabriel Sznajder, Jakub Zuralski
{"title":"Amelia-integrated environment for distributed processing","authors":"J. Kwiatkowski, Daniel Brozek, K. Czarnacki, M. Krotkiewski, Gabriel Sznajder, Jakub Zuralski","doi":"10.1109/PCEE.2002.1115226","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115226","url":null,"abstract":"Nowadays parallel processing using computers connected via computer networks is being accepted both for high performance scientific computing and for general-purpose applications. Many attempts have been made to date to address this issue. Numerous systems have been engineered to aid programmers. Although their usefulness is unquestionable, each of them has some flaws. The paper deals with the short description of Amelia-integrated environment for distributed processing. Our goal was to provide an environment, which is as general and at the same time as useful as possible.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"41 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":"131245423","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
An object observation for a Java adaptative distributed application platform 面向Java自适应分布式应用平台的对象观察
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115232
R. Olejnik, Amer Bouchi, B. Toursel
{"title":"An object observation for a Java adaptative distributed application platform","authors":"R. Olejnik, Amer Bouchi, B. Toursel","doi":"10.1109/PCEE.2002.1115232","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115232","url":null,"abstract":"In Java computing context, ADAJ (Adaptive Distributed Application in Java) provides a both execution and programming system for irregular distributed applications. From the execution point of view, load balancing is an important issue and requires special information policies. Traditionally only the computer load is taken into account. Consequently, the load balancing is made by being unaware of the relations between objects. The objects are moved of a computer on the other without knowing the consequences in term of communication. To avoid that problem we introduce in that paper two mechanims: a relation observation mechanism of distributed objects and a computer load observation. The dynamical observation information provided by these mechanisms will be able to allow a general load balancing mechanism to have an intelligent adaptative object redistribution strategy. The proposed observation tools are entirely designed in Java. Some experiment results which concerns relation observations and overhead measurements are presented.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"24 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":"134367593","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
Determining roots of real-valued functions of a single variable over a distributed network 分布式网络中单变量实值函数的根的确定
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115284
C. Maple, D. Lisowski, Jian Zhang
{"title":"Determining roots of real-valued functions of a single variable over a distributed network","authors":"C. Maple, D. Lisowski, Jian Zhang","doi":"10.1109/PCEE.2002.1115284","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115284","url":null,"abstract":"Many problems require determining the root of a real-valued function of a single variable. Maple and Marletta presented a parallel algorithm that can be used to determine a simple root of such functions. High levels of efficiency were proved for functions satisfying a set of conditions. In this work we present a framework and subsequently a piece of software to evaluate the performance of their algorithm under various conditions and for functions with varying characteristics. We also consider the effects of implementing the algorithm over a heterogeneous network, presenting results and recommendations.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"582 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":"127803698","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
Dynamic process partitioning and migration for irregular applications 不规则应用程序的动态进程分区和迁移
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115218
P. Czarnul
{"title":"Dynamic process partitioning and migration for irregular applications","authors":"P. Czarnul","doi":"10.1109/PCEE.2002.1115218","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115218","url":null,"abstract":"Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels. Efficient parallelization is difficult as it requires dynamic partitioning and mapping of such trees to available processors. Irregular applications can obtain unpredictable intermediate results which then affect creation and termination of processes. The new proposed C++ framework called DAMPVM/DAC offers a combined scheme of dynamic process/data partitioning and migration which enables automatic parallelization of irregular divide-and-conquer applications taking into account processor speeds, network status, changing application requirements as well as external load introduced by other users. Experiments on a network of workstations include adaptive integration with and without process migration as well as static and dynamic codes for image recognition. The latter ones enable to assess both the overhead of the dynamic scheme compared to serial implementations for regular applications and scalability gains for non-uniform images.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"1 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":"128838955","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
Performance of different communication mechanisms for FEM computations on PC-based cluster with SMP nodes 基于pc的SMP节点集群有限元计算中不同通信机制的性能
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115278
Tomasz Olas, Lukasz Lacinski, K. Karczewski, A. Tomas, R. Wyrzykowski
{"title":"Performance of different communication mechanisms for FEM computations on PC-based cluster with SMP nodes","authors":"Tomasz Olas, Lukasz Lacinski, K. Karczewski, A. Tomas, R. Wyrzykowski","doi":"10.1109/PCEE.2002.1115278","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115278","url":null,"abstract":"ParallelNuscaS is an object-oriented package for FEM modeling on clusters, developed at the Technical University of Czestochowa. This paper is devoted to the investigation of the influence of communication mechanisms used in the ACCORD cluster on performance of FEM computations. Last year this cluster was built in the Institute of Mathematics and Computer Science of this University At present, ACCORD contains 18 Pentium III 750 MHz processors, or 9 SMP nodes, connected both by the fast MYRINET network and standard Fast Ethernet, as well as 8 SMP nodes with 16 AMD Athlon MP 1.2 GHZ processors, connected only by the Fast Ethernet.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"105 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":"117205316","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
Techniques for optimization of net algorithms 优化网络算法的技术
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115242
A. Prihozhy, D. Mlynek, M. Solomennik, M. Mattavelli
{"title":"Techniques for optimization of net algorithms","authors":"A. Prihozhy, D. Mlynek, M. Solomennik, M. Mattavelli","doi":"10.1109/PCEE.2002.1115242","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115242","url":null,"abstract":"In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are presented. The parallelization level of the algorithms is defined by a set of parallel operator pairs. The optimization techniques cover the two key steps of parallelization flow: the generation of an optimal initial set of parallel operator pairs to meet the constraints on the execution time or implementation cost, and the generation of the final set of pairs to solve the net algorithm existence problem. The quality of the proposed techniques is evaluated by experimental results. The techniques based on the minimization of the net algorithm critical paths estimated using the maximal weight cliques of the sequential and parallel operator graphs constitute the most efficient approach to the generation of the initial and final sets of parallel operator pairs.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"1 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":"125681964","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
Modeling parallel program execution control by directed graphs with synchronous communication 用同步通信的有向图建模并行程序执行控制
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115205
D. Kopanski, E. Laskowski, M. Tudruj
{"title":"Modeling parallel program execution control by directed graphs with synchronous communication","authors":"D. Kopanski, E. Laskowski, M. Tudruj","doi":"10.1109/PCEE.2002.1115205","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115205","url":null,"abstract":"The problem of graph modeling of parallel program execution control for the use of symbolic graph simulation facilities is discussed in the paper. This problem has become more important recently, as there is a need for homogenous, symbolic representation of a parallel program and system hardware. The paper presents a method and a new software tool that provide automated extending parallel program graphs by sub-graph insertions. The inserted sub-graphs represent the execution control of the program and the behavior of the system hardware. The tool consists of the graph execution simulator and a special graph specification language based on the XML syntax. They both establish an environment for synthetic parallel program graph execution time evaluation in parallel systems with definable program execution paradigms.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"39 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":"121842411","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
Using grid-clustering methods in data classification 网格聚类方法在数据分类中的应用
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115319
P. Grabusts, A. Borisov
{"title":"Using grid-clustering methods in data classification","authors":"P. Grabusts, A. Borisov","doi":"10.1109/PCEE.2002.1115319","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115319","url":null,"abstract":"This paper examines grid-clustering method. Unlike the conventional methods, this method organizes the space surrounding the patterns. It uses a multidimensional grid data structure. The resulting block partitioning of the value space is clustered via a neighbor search. The mathematical description of the algorithms employed is given. Some case studies and ideas on how to use the algorithms are described.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"1 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":"131395122","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}
引用次数: 32
Applying cellular automata in multiprocessor scheduling 元胞自动机在多处理器调度中的应用
Proceedings. International Conference on Parallel Computing in Electrical Engineering Pub Date : 2002-09-22 DOI: 10.1109/PCEE.2002.1115234
A. Swiecicka, F. Seredyński
{"title":"Applying cellular automata in multiprocessor scheduling","authors":"A. Swiecicka, F. Seredyński","doi":"10.1109/PCEE.2002.1115234","DOIUrl":"https://doi.org/10.1109/PCEE.2002.1115234","url":null,"abstract":"Cellular automata (CA) are interesting because complex global behaviour arises from simple local interactions. In this paper, CAs are proposed to design a parallel scheduling algorithm for allocating tasks of a parallel program in the two processor system. CA solving the scheduling problem act according to rules which must be found. Effective rules for CA are discovered by a genetic algorithm (GA). With these rules, a CA-based scheduler is able to find an allocation which minimizes the total execution time of the program in the two processor system.","PeriodicalId":444003,"journal":{"name":"Proceedings. International Conference on Parallel Computing in Electrical Engineering","volume":"27 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":"115129640","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
首页 上一页 下一页 尾页
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学术官方微信