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

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

筛选
英文 中文
Gang scheduling with lightweight user-level communication 具有轻量级用户级通信的组调度
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951970
E. Frachtenberg, F. Petrini, S. Coll, Wu-chun Feng
{"title":"Gang scheduling with lightweight user-level communication","authors":"E. Frachtenberg, F. Petrini, S. Coll, Wu-chun Feng","doi":"10.1109/ICPPW.2001.951970","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951970","url":null,"abstract":"In this paper, we explore the performance of gang scheduling on a cluster using the Quadrics interconnection network. In such a cluster, the scheduler can take advantage of this network's unique capabilities, including a network interface card-based processor and memory and efficient user-level communication libraries. We developed a micro-benchmark to test the scheduler's performance under various aspects of parallel job workloads: memory usage, bandwidth and latency-bound communication, number of processes, timeslice quantum, and multiprogramming levels. Our experiments show that the gang scheduler performs relatively well under most workload conditions, is largely insensitive to the number of concurrent jobs in the system and scales almost linearly with number of nodes. On the other hand, the scheduler is very sensitive to the timeslice quantum, and values under 30 seconds can incur large overheads and fairness problems.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"53 1","pages":"339-345"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76600671","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}
引用次数: 19
Comparison of contention aware list scheduling heuristics for cluster computing 面向集群计算的竞争感知列表调度启发式算法比较
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951976
O. Sinnen, L. Sousa
{"title":"Comparison of contention aware list scheduling heuristics for cluster computing","authors":"O. Sinnen, L. Sousa","doi":"10.1109/ICPPW.2001.951976","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951976","url":null,"abstract":"In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a Directed Acyclic Graph (DAG) to a target machine. As most heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the inter communication links. This article extends the list scheduling heuristic for contention aware scheduling on heterogenous arbitrary machines. The extension is based on the idea of scheduling edges to links, likewise the scheduling of nodes to processors. Based on this extension, we compare eight priority schemes for the node order determination of the first phase of list scheduling. Random graphs are generated and scheduled with the different schemes to homogenous and heterogenous parallel systems from the area of cluster computing. The experiments demonstrate the appropriateness of our extended list scheduling for homogeneous and heterogenous cluster architectures.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"151 1","pages":"382-387"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75959959","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}
引用次数: 18
Modeling of handoffs and performance analysis of wireless data networks 无线数据网络切换建模与性能分析
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951992
Qing-An Zeng, D. Agrawal
{"title":"Modeling of handoffs and performance analysis of wireless data networks","authors":"Qing-An Zeng, D. Agrawal","doi":"10.1109/ICPPW.2001.951992","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951992","url":null,"abstract":"In this paper, we introduce a handoff scheme for data mobile cellular radio systems. A steady-stale traffic model is established and an analytical model of the system performance is presented. Average queue length and transmission delay are evaluated. Although mobile users holding channels move from one cell to another, there is almost no packet loss except for the negligibly small blocking probability because a channel request can be transferred from the queue of one base station to another.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"241 1","pages":"491-496"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75772389","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}
引用次数: 20
Triplet: A clustering scheduling algorithm for heterogeneous systems Triplet:异构系统的集群调度算法
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951956
B. Cirou, E. Jeannot
{"title":"Triplet: A clustering scheduling algorithm for heterogeneous systems","authors":"B. Cirou, E. Jeannot","doi":"10.1109/ICPPW.2001.951956","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951956","url":null,"abstract":"The goal of the OURAGAN project is to provide access of meta-computing resources to Scilab users. We present here an approach that consists, given a Scilab script, in scheduling and executing this script on a heterogeneous cluster of machines. One of the most effective scheduling technique is called clustering which consists in grouping tasks on virtual processors (clusters) and then mapping clusters onto real processors. In this paper we study and apply the clustering technique for heterogeneous systems. We present a clustering algorithm called Triplet, study its performance and compare it to the HEFT algorithm. We show that Triplet has good characteristics and outperforms HEFT in most of the cases.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"160 1","pages":"231-236"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72864731","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}
引用次数: 85
The design and performance of an intelligent Jini load balancing service 智能Jini负载均衡服务的设计和性能
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951973
Lap-Sun Cheung, Yu-Kwong Kwok
{"title":"The design and performance of an intelligent Jini load balancing service","authors":"Lap-Sun Cheung, Yu-Kwong Kwok","doi":"10.1109/ICPPW.2001.951973","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951973","url":null,"abstract":"In this paper, we describe the design and implementation of a dynamic fuzzy-decision based load balancing system incorporated in a distributed object computing environment. The proposed approach works by using a fuzzy logic controller which informs a client object to use the most appropriate service such that load balancing among servers is achieved. We have chosen Jini to build our experimental middleware platform, on which our proposed approach as well as other approaches are implemented and compared. Extensive experiments are conducted to investigate the effectiveness of our fuzzy-decision based approach, which is found to be consistently better than other approaches.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"32 1","pages":"361-366"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91262612","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
Multi-hop all-to-all broadcast on WDM optical networks WDM光网络中的多跳全对全广播
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951964
Q. Gu, S. Peng
{"title":"Multi-hop all-to-all broadcast on WDM optical networks","authors":"Q. Gu, S. Peng","doi":"10.1109/ICPPW.2001.951964","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951964","url":null,"abstract":"It is known that the minimum number of wavelengths for realizing all-to-all broadcast (gossiping) in one-hop of optical routing on the ring (resp. the 2-dimensional torus) of N nodes is [[N/sup 2//4]/2] (resp. cN/sup 1+1/2/,c/spl ap/1/8). These numbers can be too large even for moderate values of N. One approach to reduce the number of wavelengths is to realize gossiping in multi-hops of routing. We prove that gossiping can be realized in k-hops by c/sub k/N/sup 1+1/k/(c/sub k//spl ap/1/2/sup 2+1/k/) wavelengths on the ring, c'N/sup 1+1/(2k)/(c'/spl ap/1/4) wavelengths on the 2-dimensional torus, and c'/sup N1+1/(3k)/ wavelengths on the 3-dimensional torus on the simple model: in the (j+1)st hop each node just forwards each message received in the jth hop to its next destinations. We also give the upper bounds on the numbers of wavelengths for gossiping in two-hops and three-hops for the ring, 2-dimensional torus, and 3-dimensional torus on the merge model: in the (j+1)st hop each node can merge different messages received in the jth hop into one and sends the merged message to its next destinations.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"52 1","pages":"291-296"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89096309","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
Sorting networks with applications to hierarchical optical interconnects 分类网络及其在分层光互连中的应用
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951969
R. Kannan, S. Ray
{"title":"Sorting networks with applications to hierarchical optical interconnects","authors":"R. Kannan, S. Ray","doi":"10.1109/ICPPW.2001.951969","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951969","url":null,"abstract":"The Banyan network is shown to have a computationally unsuitable structure for finding maximum passable subpermutations, which is proved NP-complete. Using some non-blocking properties on the cube and reverse Banyan networks, a network topologically equivalent to the Batcher sorter, but functionally equivalent to the Batcher-Banyan network is derived for routing incomplete permutations. A log/sub 2/ N(2w-1) stage radix sorter for w-bit inputs, including duplicate inputs, that uses only log/sub 2/ N+1 bit address headers for routing through each 2 log/sub 2/ N stages is shown, which can be used in sort-MIN type packet switches. Space-time sorting networks based on these principles are derived, which can be used in hierarchical wavelength multiplexed optical networks.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"116 1","pages":"327-332"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79145048","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
An efficient parallel algorithm for solving unsteady nonlinear equations 求解非定常非线性方程的一种高效并行算法
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951854
Wilson Rivera, Jianping Zhu, D. Huddleston
{"title":"An efficient parallel algorithm for solving unsteady nonlinear equations","authors":"Wilson Rivera, Jianping Zhu, D. Huddleston","doi":"10.1109/ICPPW.2001.951854","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951854","url":null,"abstract":"This paper discusses the application of a new parallel non-overlapping domain decomposition algorithm, based on explicit predictors and implicit correctors, to the solution of nonlinear equations. The results demonstrate significant improvement in accuracy for calculating transient solutions using the new approach. In addition, the parallel algorithm scales well as the number of processors increases for large scale problems.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"105 1","pages":"79-84"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77679336","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
An energy-efficient initialization protocol for wireless sensor networks 无线传感器网络的高能效初始化协议
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951981
R. Bhuvaneswaran, J. Bordim, J. Cui, N. Ishii, K. Nakano
{"title":"An energy-efficient initialization protocol for wireless sensor networks","authors":"R. Bhuvaneswaran, J. Bordim, J. Cui, N. Ishii, K. Nakano","doi":"10.1109/ICPPW.2001.951981","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951981","url":null,"abstract":"A wireless sensor network (WSN, for short) is a distributed system consisting of n sensor nodes and a base station. We propose an energy-efficient protocol to initialize sensor nodes in WSNs, that is, to assign a unique ID to each sensor node. We show that if the number n of sensor nodes is known beforehand, for any f/spl ges/1 and any small /spl mu/ (O</spl mu/<1), a WSN without collision detection capability can be initialized in O((log 1//spl mu/+log f)n/sup 1+/spl mu//) time slots, with probability exceeding 1-1/f, with no sensor node being awake for more than O(log 1//spl mu/+log f) time slots.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"71 1","pages":"423-428"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77149633","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
Fault tolerance in the WebCom metacomputer WebCom元计算机的容错性
Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops Pub Date : 2001-09-03 DOI: 10.1109/ICPPW.2001.951958
J. Morrison, James J. Kennedy, D. A. Power
{"title":"Fault tolerance in the WebCom metacomputer","authors":"J. Morrison, James J. Kennedy, D. A. Power","doi":"10.1109/ICPPW.2001.951958","DOIUrl":"https://doi.org/10.1109/ICPPW.2001.951958","url":null,"abstract":"This paper addresses fault tolerance in the WebCom metacomputer. WebCom's computation platform is dynamically reconfigurable and volunteer-based. Since its constituent machines may join and leave unpredictability, fault survival and efficient fault recovery is of paramount importance. A fault tolerance mechanism is outlined, which relies on a fast and efficient processor replacement procedure. It is shown that the characteristics of this procedure, together with the hierarchical and referentially transparent nature of WebCom executions, can be used to limit the effect of a fault to its immediate neighbourhood.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"319 1","pages":"245-250"},"PeriodicalIF":0.0,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77134996","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
首页 上一页 下一页 尾页
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学术官方微信