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

Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops最新文献

筛选
英文 中文
Solution of computational fluid dynamics problems on parallel computers with distributed memory 分布式存储并行计算机计算流体动力学问题的求解
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951846
B. Chetverushkin, N. Churbanova, M. Trapeznikova
{"title":"Solution of computational fluid dynamics problems on parallel computers with distributed memory","authors":"B. Chetverushkin, N. Churbanova, M. Trapeznikova","doi":"10.1109/ICPPW.2001.951846","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951846","url":null,"abstract":"There are presented some applications of parallel computers with distributed memory to solving large-scale CFD problems. Two types of flows are predicted. These are multiphase immiscible incompressible fluid flows in a porous medium and viscous compressible gas flows at low Mach number. Oil recovery problems, an isothermal lid-driven cavity flow and gas flows in a horizontal chemical reactor are considered as applications. Mathematical models as well as parallel implicit and semi-implicit algorithms are presented. Efficiency of the corresponding codes executing in different parallel environments is demonstrated.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"41 1","pages":"31-36"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86430144","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
On the use of a simple mobility model in ad hoc routing 简单移动模型在自组织路由中的应用
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951990
E. Elmallah, H. Hassanein, H. Aboelfotoh
{"title":"On the use of a simple mobility model in ad hoc routing","authors":"E. Elmallah, H. Hassanein, H. Aboelfotoh","doi":"10.1109/ICPPW.2001.951990","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951990","url":null,"abstract":"Future ad hoc networks are expected to provide mobile hosts with access to a wide range of multimedia services. Mobility, however, poses a challenge towards providing adequate support to quality of service (QoS) routing. The paper considers ways of enhancing ad hoc routing by seeking means to quantify, model and exploit knowledge of various user mobility profiles. In this context, we investigate the use of a simple spatial probabilistic model for relatively low speed mobile hosts. Using the model, we examine combinatorial aspects of two basic routing problems: assessing the likelihood that a given end-to-end route exists, and selecting a highly probable route that balances nodal loads among a number of hosts. We devise efficient approximate solutions to both problems, and discuss possible ways of using the solutions in some existing on-demand routing protocols.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"9 2 1","pages":"479-484"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79639240","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 iterative solver based on the Schur complement system 基于Schur补系统的并行迭代求解器
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951921
G. Larrazábal, J. Cela
{"title":"A parallel iterative solver based on the Schur complement system","authors":"G. Larrazábal, J. Cela","doi":"10.1109/ICPPW.2001.951921","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951921","url":null,"abstract":"We present a parallel iterative solver for the Schur system. We have developed two preconditioners for this system. The preconditioners are based in a strongly dropped factorisation and algebraic multigrid technique, respectively. Two levels of parallelism are exploited using PVM and openMP. The preconditioners are tested with a scalar convection-diffusion equation, a set of industrial test cases arising from the finite element package PERMAS and the Davis collection. We have obtained quasi-linear speed-up until 32 processors.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"15 1","pages":"149-154"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78689306","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
A new multiagent based architecture for high performance I/O in clusters 一个新的基于多代理的架构，用于集群中的高性能I/O
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951944
María S. Pérez, Félix García, J. Carretero
{"title":"A new multiagent based architecture for high performance I/O in clusters","authors":"María S. Pérez, Félix García, J. Carretero","doi":"10.1109/ICPPW.2001.951944","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951944","url":null,"abstract":"This paper presents MAPFS, a MultiAgent Parallel File System for clusters. MAPFS has been conceived as a client able to interact with different existing traditional or distributed servers and provide them the parallel I/O characteristics. Therefore, MAPFS allows take advantage of the use of the parallelism in clusters of workstations. MAPFS defines a multiagent architecture that defines the storage group concept, as a set of servers that form a group to support the parallel I/O for MAPFS. MAPFS offers a file system interface that include traditional operations, advanced and collective operations, and fault tolerance and caching operations.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"27 1","pages":"201-206"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79045972","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
Package routing algorithms in mobile ad-hoc wireless networks 移动自组织无线网络中的包路由算法
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951991
Xiao Chen, Xingde Jia
{"title":"Package routing algorithms in mobile ad-hoc wireless networks","authors":"Xiao Chen, Xingde Jia","doi":"10.1109/ICPPW.2001.951991","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951991","url":null,"abstract":"A mobile ad-hoc network (MANET) is formed by a cluster of mobile stations randomly located within a certain area. Because of their low power, low bandwidth and mobility, routing in a MANET poses special challenges. In this paper, an efficient routing algorithm is discussed for MANETs. This routing algorithm has a small transmission delay and needs only a small and easy-to-update generation table for each station. In addition, the communication channels in the routing algorithm are dynamically assigned, which allows a large MANET to use a limited number of communication channels.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"12 1","pages":"485-490"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75096224","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
Feedback guided dynamic loop scheduling; A theoretical approach 反馈导向动态循环调度;理论方法
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951913
T. Tabirca, Len Freeman, S. Tabirca, L. Yang
{"title":"Feedback guided dynamic loop scheduling; A theoretical approach","authors":"T. Tabirca, Len Freeman, S. Tabirca, L. Yang","doi":"10.1109/ICPPW.2001.951913","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951913","url":null,"abstract":"In this paper we review existing loop scheduling algorithms and also describe the feedback-guided dynamic loop scheduling (FGDLS) algorithm that was proposed in Bull et al. (1996) and Bull (1998). The FGDLS algorithm uses a feedback mechanism to schedule a parallel loop within a sequential outer loop. It has been shown to perform well for scheduling problems for which the load associated with the parallel loop changes relatively slowly as the outer sequential loop executes. However the question of convergence of the FGDLS algorithm has remained an open question. In this paper we are able to establish sufficient conditions (essentially requiring that the workload does not change too rapidly with loop iteration count) for the (global) convergence of a continuous analogue of the feedback-guided algorithm.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"1 1","pages":"115-121"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83075561","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
Modular construction of model partitioning processes for parallel logic simulation 并行逻辑仿真模型划分过程的模块化构造
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951858
K. Hering, G. Rünger, S. Trautmann
{"title":"Modular construction of model partitioning processes for parallel logic simulation","authors":"K. Hering, G. Rünger, S. Trautmann","doi":"10.1109/ICPPW.2001.951858","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951858","url":null,"abstract":"Logic simulation of a complex processor model in VLSI design is very time consuming. One possibility to increase the simulation speed is to partition the processor model and assign the resulting parts to simulator instances that cooperate over a loosely-coupled system. For corresponding model partitioning processes, we have developed a distributed framework parallelMAP implementing a hierarchical partitioning strategy. It is intended to be used as production environment in VLSI design as well as an experimental test bed for algorithm development. In this paper we describe the possibilities parallelMAP offers for the modular construction of partitioning processes starting from a set of basic sequential and parallel modules. Experimental experiences are given with respect to IBM processor models comprising from 1.5*10/sup 5/ to 2.5*10/sup 6/ elements at gate level.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"7 1","pages":"99-105"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85349635","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
A wavelength assignment heuristic to minimize SONET ADMs in WDM rings 在WDM环中最小化SONET adm的一种波长分配启发式方法
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951959
Xin Yuan, Amit Fulay
{"title":"A wavelength assignment heuristic to minimize SONET ADMs in WDM rings","authors":"Xin Yuan, Amit Fulay","doi":"10.1109/ICPPW.2001.951959","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951959","url":null,"abstract":"Optical Wavelength Division Multiplexing (WDM) rings are being deployed to support multiple SONET/SDH self-healing rings over a single physical optical ring. In such systems, the dominating cost is the SONET Add/Drop Multiplexers (ADMs). To minimize the system cost, algorithms must be developed to assign wavelengths to lightpaths in the system so that the number of ADMs required is minimized. However the problem of optimal wavelength assignment to minimize SONET ADMs is NP-hard. Existing heuristic algorithms for this problem include the assign first, the iterative matching and the iterative merging heuristics. In this paper we propose a new wavelength assignment heuristic to minimize SONET ADMs. Our heuristic is on average 3% to 5% more effective in finding the opportunities to share ADMs (and thus to reduce the total number of ADMs required) than the most effective existing heuristic, the iterative merging algorithm.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"62 1","pages":"257-262"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85234962","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
Recent advances in wireless networking 无线网络的最新进展
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951984
D. Agrawal
{"title":"Recent advances in wireless networking","authors":"D. Agrawal","doi":"10.1109/ICPPW.2001.951984","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951984","url":null,"abstract":"Wireless technology is growing at a breath taking pace and is influencing the way people live and interact. A wireless system enables users to go anywhere, still be connected to both voice and data communications and have access to systems with different levels of complexity ranging from voice communications to database retrieval. The satellite based global positioning capability has added another dimension to the usefulness of the system. Handling of voice information has achieved some degree of maturity while data communication is just picking up the steam. In this presentation, we describe state-of-the-art of the wireless and mobile networking area and illustrate their applications in diverse areas like travel, education, stock trading, military, package delivery, disaster recovery and medical emergency care. Most of the data applications can be categorized as wireless/mobile access to internet, wireless/mobile access to intranet and wireless LAN/ad-hoc access between mobile systems. The persuasiveness of mobile computing is being felt not only by business, but also by households and Bluetooth Technology is allowing different devices like laptops, mobile phones, pagers, and other household devices to communicate with each other without the use of cables. The future of mobile computing seems to be very promising and anywhere, anytime any device access to information is expected to be a reality. We also look at the challenges faced by the wireless technology.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"81 1","pages":"443-443"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76912059","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}
引用次数: 22
Achieving replication consistency using cooperating mobile agents 使用协作移动代理实现复制一致性
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951986
Jiannong Cao, A. Chan, Jie Wu
{"title":"Achieving replication consistency using cooperating mobile agents","authors":"Jiannong Cao, A. Chan, Jie Wu","doi":"10.1109/ICPPW.2001.951986","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951986","url":null,"abstract":"One problem in replication is coordinating the updates made to the copies maintained at different replicated servers so that data consistency is ensured. The paper presents a novel approach to designing protocols for accessing replicated data in a large-scale distributed environment such as the Internet. Unlike traditional message-passing based protocols which require expensive exchanges of messages among the replicated servers, the proposed approach uses cooperating mobile agents to synchronize the access to the replicated data at different servers. The design of such a mobile-agent enabled, fully-distributed protocol is presented and a prototypical implementation using IBM's Aglets is described. The performance of the protocol is also discussed.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"10875 1","pages":"453-458"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76037341","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
首页 上一页 下一页 尾页
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学术官方微信