Proceedings International Conference on Parallel Processing最新文献

A system for monitoring and management of computational grids 一种用于监测和管理计算网格的系统

Proceedings International Conference on Parallel Processing Pub Date : 2013-08-07 DOI: 10.1109/ICPP.2002.1040859

Warren Smith

引用次数: 31

Distributed game-tree search using transposition table driven work scheduling 使用换位表驱动的分布式游戏树搜索工作调度

Proceedings International Conference on Parallel Processing Pub Date : 2002-08-18 DOI: 10.1109/ICPP.2002.1040888

Akihiro Kishimoto, J. Schaeffer

引用次数: 21

A selection technique for replicated multicast video servers 复制多播视频服务器的选择技术

Proceedings International Conference on Parallel Processing Pub Date : 2002-08-18 DOI: 10.1109/ICPP.2002.1040913

Akihito Hiromori, H. Yamaguchi, K. Yasumoto, T. Higashino, K. Taniguchi

引用次数: 3

On-line permutation routing on WDM all-optical networks WDM全光网络的在线排列路由

Proceedings International Conference on Parallel Processing Pub Date : 2002-08-18 DOI: 10.1109/ICPP.2002.1040898

Q. Gu

{"title":"On-line permutation routing on WDM all-optical networks","authors":"Q. Gu","doi":"10.1109/ICPP.2002.1040898","DOIUrl":"https://doi.org/10.1109/ICPP.2002.1040898","url":null,"abstract":"For a sequence (s/sub 1/, t/sub 1/), ..., (s/sub i/, t/sub i/), ... of routing requests with (s/sub i/, t/sub i/) arriving at time step i on the wavelength-division multiplexing (WDM) all-optical network, the on-line routing problem is to set-up a path s/sub i/ /spl rarr/ t/sub i/ and assign a wavelength to the path in step i such that the paths set-up so far with the same wavelength are edge-disjoint. Two measures are important for on-line routing algorithms: the number of wavelengths used and the response time. The sequence (s/sub 1/,t/sub 1/), ..., (s/sub i/, t/sub i/), ... is called a permutation if each node in the network appears in the sequence at most once as a source and at most once as a destination. Let H/sub n/ be the n-dimensional WDM all-optical hypercube. We develop two on-line routing algorithms on H/sub n/. Our first algorithm is a deterministic one which realizes any permutation by at most /spl lceil/3(n-1)/2/spl rceil/ + 1 wavelengths with response time O(2/sup n/). The second algorithm is a randomized one which realizes any permutation by at most (3/2 + /spl delta/)(n-1) wavelengths, where /spl delta/ can be any value satisfying /spl delta/ /spl ges/ 2/(n-1). The average response time of the algorithm is O(n(1 + /spl delta/)//spl delta/). Both algorithms use at most O(n) wavelengths for the permutation on Hn. This improves the previous bound of O(n/sup 2/).","PeriodicalId":393916,"journal":{"name":"Proceedings International Conference on Parallel Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121577771","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

The tracefile testbed - a community repository for identifying and retrieving HPC performance data 跟踪文件测试平台——用于识别和检索HPC性能数据的社区存储库

Proceedings International Conference on Parallel Processing Pub Date : 2002-08-18 DOI: 10.1109/ICPP.2002.1040872

K. Ferschweiler, S. Harrah, D. Keon, M. Calzarossa, D. Tessera, C. Pancake

引用次数: 1

Worst case analysis of a greedy multicast algorithm in k-ary n-cubes k-ary n-立方体中贪婪组播算法的最坏情况分析

Proceedings International Conference on Parallel Processing Pub Date : 2002-08-18 DOI: 10.1109/ICPP.2002.1040908

S. Fujita

引用次数: 0

Design and evaluation of scalable switching fabrics for high-performance routers 高性能路由器可扩展交换结构的设计与评估

Proceedings International Conference on Parallel Processing Pub Date : 2002-08-18 DOI: 10.1109/ICPP.2002.1040871

N. Tzeng, Ravi C. Batchu

{"title":"Design and evaluation of scalable switching fabrics for high-performance routers","authors":"N. Tzeng, Ravi C. Batchu","doi":"10.1109/ICPP.2002.1040871","DOIUrl":"https://doi.org/10.1109/ICPP.2002.1040871","url":null,"abstract":"This work considers switching fabrics with distributed packet routing to achieve high scalability and low costs. The considered switching fabrics are based on a multistage structure with different re-circulation designs, where adjacent stages are interconnected according to the indirect n-cube connection style. They all compare favorably with an earlier multistage-based counterpart according to extensive simulation, in terms of performance measures of interest and hardware complexity. When queues are incorporated in the output ports of switching elements (SEs), the total number of stages required in our proposed fabrics to reach a given performance level can be reduced substantially. The performance of those fabrics with output queues is evaluated under different \"speedups\" of the queues, where the speedup is the operating clock rate ratio of that at the SE core to that over external links. Our simulation reveals that a small speedup of 2 is adequate for buffered switching fabrics comprising 4/spl times/8 SEs to deliver better performance than their unbuffered counterparts with 50% more stages of SEs, when the fabric size is 256. The buffered switching fabrics under our consideration are scalable and of low costs, ideally suitable for constructing high-performance routers with large numbers of line cards.","PeriodicalId":393916,"journal":{"name":"Proceedings International Conference on Parallel Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2002-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127106497","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

Software caching using dynamic binary rewriting for embedded devices 嵌入式设备使用动态二进制重写的软件缓存

Proceedings International Conference on Parallel Processing Pub Date : 2002-08-18 DOI: 10.1109/ICPP.2002.1040920

Chad Huneycutt, J. Fryman, K. Mackenzie

引用次数: 26

Introducing SCSI-to-IP cache for storage area networks 为存储区域网络引入scsi到ip缓存

Proceedings International Conference on Parallel Processing Pub Date : 2002-08-18 DOI: 10.1109/ICPP.2002.1040875

Xubin He, Qing Yang, Ming Zhang

引用次数: 17

Analysis of memory hierarchy performance of block data layout 块数据布局的内存层次性能分析

Proceedings International Conference on Parallel Processing Pub Date : 2002-08-18 DOI: 10.1109/ICPP.2002.1040857

Neungsoo Park, Bo Hong, V. Prasanna

引用次数: 36