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

Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000最新文献

筛选
英文 中文
Parallel Lagrange interpolation on the star graph 星图上的平行拉格朗日插值
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846064
H. Sarbazi-Azad, L. Mackenzie, M. Ould-Khaoua, S. Akl
{"title":"Parallel Lagrange interpolation on the star graph","authors":"H. Sarbazi-Azad, L. Mackenzie, M. Ould-Khaoua, S. Akl","doi":"10.1109/IPDPS.2000.846064","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846064","url":null,"abstract":"This paper introduces a parallel algorithm for computing an N=n!-point Lagrange interpolation on an n-star (n>2). It exploits several communication techniques on stars in a novel way which can be adapted for computing similar functions. The algorithm is optimal and consists of three phases: initialization, main and final. While there is no computation in the initialization phase, the main phase is composed of n!/2 steps, each consisting of four multiplications, four subtractions and one communication operation, and an additional step including one division and one multiplication. The final phase is carried out in (n-1) sub-phases each with O(log n) steps where each step takes three communications and one addition.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"10 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":"131647507","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
Replicating the contents of a WWW multimedia repository to minimize download time 复制WWW多媒体存储库的内容以减少下载时间
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846027
Thanasis Loukopoulos, I. Ahmad
{"title":"Replicating the contents of a WWW multimedia repository to minimize download time","authors":"Thanasis Loukopoulos, I. Ahmad","doi":"10.1109/IPDPS.2000.846027","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846027","url":null,"abstract":"Dynamic replication algorithms aim at allocating, migrating and deleting copies of an object over various Internet hosts, according to the access patterns exhibited online, so as to improve object proximity for the end-users and/or load-balance the servers. Most of the existing algorithms try to disseminate the objects of an entire Internet Service Provider (ISP), without taking into account the needs and characteristics of specific web sites with large commercial value. In this paper we tackle the replication problem in an Internet environment, inspired by the need of news agencies and other information providers to include in their pages multimedia content without incurring high access delays. We consider an environment that consists of a central multimedia repository and various physically dispersed sires. We propose a cost model to formalize the replication of multimedia objects located at the repository which can result in decreasing the download time. Taking into account implementation issues, such as the storage and processing capacity constraints, the proposed replication policy is evaluated and compared with alternatives including an ideal LRU caching scheme. Qualitative comparisons with the other replication schemes are reported as well.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"18 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":"114834660","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
Optimal broadcasting in all-port meshes of trees with distance-insensitive routing 具有距离不敏感路由的树的全端口网格的最优广播
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846005
Petr Salinger, P. Tvrdík
{"title":"Optimal broadcasting in all-port meshes of trees with distance-insensitive routing","authors":"Petr Salinger, P. Tvrdík","doi":"10.1109/IPDPS.2000.846005","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846005","url":null,"abstract":"The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-and-forward, is used. How its properties compare to meshes if distance-insensitive routing, such as wormhole, is used, was not previously understood. In this paper, we show that meshes of trees allow an elegant and optimal one-to-all broadcast algorithm supposing that routers implement distance-insensitive routing and have all-port capability.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"97 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":"115640762","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
A general parallel simulated annealing library and its application in airline industry 通用并行模拟退火库及其在航空工业中的应用
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.845964
Georg Kliewer, S. Tschöke
{"title":"A general parallel simulated annealing library and its application in airline industry","authors":"Georg Kliewer, S. Tschöke","doi":"10.1109/IPDPS.2000.845964","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.845964","url":null,"abstract":"To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances of these problems or those with a lot of hard constraints even fast heuristics require a considerable amount of computational time. At the same time, especially for sensitivity analyses, fast response times are necessary in real-world applications. Therefore, to speed up the computation a parallelization of metaheuristics is very desirable. We present parSA, an object-oriented simulated annealing library based on C++ and using the MPI message passing interface. It provides an automatic, transparent way of parallelizing simulated annealing. The efficient communication in parSA is the main reason for its success in several real-world applications. To demonstrate performance of parSA we address the weekly fleet assignment problem (FAP) as a real-world application. It is one of the optimization problems which occur in the process of operating an airline. Given a flight schedule and aircraft of different types (subfleets), to each flight leg a subfleet has to be assigned. Large real-world instances have been provided by internationally operating airlines. We show that our heuristic approach using our library parSA is very competitive to the commonly used integer-program (IF) approach.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"12 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":"115706122","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}
引用次数: 31
Improving throughput and utilization in parallel machines through concurrent gang 通过并发组提高并行机的吞吐量和利用率
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.845973
Fabrício A. B. Silva, I. Scherson
{"title":"Improving throughput and utilization in parallel machines through concurrent gang","authors":"Fabrício A. B. Silva, I. Scherson","doi":"10.1109/IPDPS.2000.845973","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.845973","url":null,"abstract":"In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensive parallel jobs with the flexibility of a Unix scheduler for sequential and I/O intensive jobs. Besides that, scalability in Concurrent Gang is achieved through the use of a global synchronizer that coordinates the gang scheduler among different processors. Simulation results are provided comparing the performance of Concurrent Gang with Gang Scheduling and show significant performance improvements, in particular for I/O bound jobs.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"52 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120931208","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}
引用次数: 17
An analytical model of fully-adaptive wormhole-routed k-ary n-cubes in the presence of hot spot traffic 存在热点流量的全自适应虫孔路由k-ary n-立方体的解析模型
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846041
H. Sarbazi-Azad, L. Mackenzie, M. Ould-Khaoua
{"title":"An analytical model of fully-adaptive wormhole-routed k-ary n-cubes in the presence of hot spot traffic","authors":"H. Sarbazi-Azad, L. Mackenzie, M. Ould-Khaoua","doi":"10.1109/IPDPS.2000.846041","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846041","url":null,"abstract":"Several analytical models of fully-adaptive routing have recently been proposed for wormhole-routed k-ary n-cubes under the uniform traffic pattern. However, there has been hardly any model reported yet that deals with other important non-uniform traffic patterns, such as hot spots. As a result, most studies have resorted to simulation when evaluating the performance merits of adaptive routing. This paper describes the first analytical model of fully-adaptive wormhole routing in k-ary n-cubes in the presence of hot spot traffic. Results from simulation show close agreement with those predicted by the model.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"63 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":"122507387","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
Broadcasting in hypercubes in the circuit switched model 电路交换模型中的超立方体广播
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.845960
J. Bermond, T. Kodate, S. Pérennes, A. Bonnecaze, P. Solé
{"title":"Broadcasting in hypercubes in the circuit switched model","authors":"J. Bermond, T. Kodate, S. Pérennes, A. Bonnecaze, P. Solé","doi":"10.1109/IPDPS.2000.845960","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.845960","url":null,"abstract":"In this paper we propose a method which enables us to construct almost optimal broadcast schemes on an n-dimensional hypercube in the circuit switched, /spl Delta/-port model. In this model, an initiator must inform all the nodes of the network in a sequence of rounds. During a round, vertices communicate along arc-disjoint dipaths. Our construction is based on particular sequences of nested binary codes having the property that each code can inform the next one in a single round. This last property is insured by a flow technique and results about symmetric flow networks. We apply the method to design new schemes improving and generalizing the previous results. Our schemes are the best possible algebraic schemes, and they are optimal in the case n=2/sup p/-1.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"1 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":"128460178","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
Space and time efficient self-stabilizing and l-exclusion in tree networks 树状网络的时空有效自稳定和l-不相容
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846031
Rachid Hadid
{"title":"Space and time efficient self-stabilizing and l-exclusion in tree networks","authors":"Rachid Hadid","doi":"10.1109/IPDPS.2000.846031","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846031","url":null,"abstract":"We propose a very efficient self-stabilizing l-exclusion algorithm in rooted tree networks. The l-exclusion problem is a generalization of the mutual exclusion problem-we allow l (l/spl ges/1) processors, instead of 1, to use a shared resource. The algorithm is semi-uniform and its space requirement is (l+3)/spl Delta//sub r/ states (or [log((l+3)/spl Delta//sub r/)] bits) for the root r, 3/spl Delta//sub p/ states (or [log(3/spl Delta//sub p/)] bits) for an internal processor p, and 2 states (or 1 bit) for a leaf processor, where /spl Delta//sub p/ is the degree of processor p. Our algorithm is unique in the sense that this is the first l-exclusion algorithm on trees, whose space requirement is independent of the size of the network for any processor and is independent of l for all processors except the root.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"1 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":"130335512","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
Balancing traffic load for multi-node multicast in a wormhole 2D torus/mesh 二维虫洞环/网格中多节点组播的流量负载均衡
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846042
San-Yuan Wang, Y. Tseng, Ching-Sung Shiu, J. Sheu
{"title":"Balancing traffic load for multi-node multicast in a wormhole 2D torus/mesh","authors":"San-Yuan Wang, Y. Tseng, Ching-Sung Shiu, J. Sheu","doi":"10.1109/IPDPS.2000.846042","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846042","url":null,"abstract":"This paper considers the multi-node multicast problem in a wormhole-routed 20 torus/mesh, where an arbitrary number of source nodes each intending to multicast a message to an arbitrary, set of destinations. To resolve the contention and the congestion problems, we propose to partition the network into subnetworks to distribute, and thus balance, the traffic load among all network links. Several ways to partition the network are explored. Simulation results show significant improvement over existing results for torus and mesh networks.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"86 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":"134082997","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}
引用次数: 15
Speed vs. accuracy in simulation for I/O-intensive applications I/ o密集型应用模拟中的速度与准确性
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000 Pub Date : 2000-05-01 DOI: 10.1109/IPDPS.2000.846001
Hyeonsang Eom, J. Hollingsworth
{"title":"Speed vs. accuracy in simulation for I/O-intensive applications","authors":"Hyeonsang Eom, J. Hollingsworth","doi":"10.1109/IPDPS.2000.846001","DOIUrl":"https://doi.org/10.1109/IPDPS.2000.846001","url":null,"abstract":"This paper presents a family of simulators that have been developed for data-intensive applications, and a methodology to select the most efficient one based on a user-supplied requirement for accuracy. The methodology consists of a series of tests that select an appropriate simulation based on the attributes of the application. In addition, each simulator provides two estimates of application execution time: one for the minimum expected time and the other for the maximum. We present the results of applying the strategy to existing applications and show that we can accurately simulate applications tens to hundreds of times faster than application execution time.","PeriodicalId":206541,"journal":{"name":"Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000","volume":"11 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":"133375100","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}
引用次数: 16
首页 上一页 下一页 尾页
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学术官方微信