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

Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)最新文献

筛选
英文 中文
A convergence algorithm to help enhance the performance of distributed systems on large networks 一种有助于提高大型网络上分布式系统性能的收敛算法
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778956
Allan K. Y. Wong, Joseph H. C. Wong
{"title":"A convergence algorithm to help enhance the performance of distributed systems on large networks","authors":"Allan K. Y. Wong, Joseph H. C. Wong","doi":"10.1109/ISPAN.1999.778956","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778956","url":null,"abstract":"The proposed convergence algorithm quickly and accurately predicts the mean message response time and communication channel. From the predicted value the correct window size of the desired percentage of time-out tolerance in message transmission and response can be computed. A correct window size is a necessity for reducing excessive message retransmissions caused by time-outs. The convergence algorithm is particularly useful for enhancing the performance of time-critical distributed applications running on large networks such as the Internet. Prolonged delays in message response in these systems may lend to fatal errors. The discussion in this paper concentrates mainly on the theory and verification of the convergence algorithm. The simulation results have confirmed that the proposed algorithm is indeed a cost/effective solution for enhancing system performance. The simplicity of the convergence algorithm makes it worthwhile for practical implementation in real systems.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114595672","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
Message ring-based channel reallocation scheme for cellular networks 基于消息环的蜂窝网络信道重分配方案
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778975
Kok Yong Lim, Mohan J. Kumar, Sajal K. Das
{"title":"Message ring-based channel reallocation scheme for cellular networks","authors":"Kok Yong Lim, Mohan J. Kumar, Sajal K. Das","doi":"10.1109/ISPAN.1999.778975","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778975","url":null,"abstract":"Wireless communication suffers from many restrictions due to the inherent limitations of the wireless media and existing wireless communication protocols. Limited radio frequency spectrum (or bandwidth) is one of the major issues in wireless communication. In order to efficiently share the limited bandwidth, different channel allocation (or channel assignment) schemes have been developed. In this paper, we propose a frequency reallocation scheme, message ring-based channel reallocation (MRCR) to improve channel utilization in wireless communication systems. MRCR uses software agents to circulate and maintain a message ring that carries bandwidth information. We present results of simulation studies to demonstrate the effectiveness of the MRCR scheme.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121386401","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
Parallel algorithms for all nearest neighbors of binary images on the BSP model 基于BSP模型的二值图像的所有近邻并行算法
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778970
Takashi Ishimizu, A. Fujiwara, M. Inoue, T. Masuzawa, H. Fujiwara
{"title":"Parallel algorithms for all nearest neighbors of binary images on the BSP model","authors":"Takashi Ishimizu, A. Fujiwara, M. Inoue, T. Masuzawa, H. Fujiwara","doi":"10.1109/ISPAN.1999.778970","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778970","url":null,"abstract":"We present two parallel algorithms for computing the nearest neighbors of an n/spl times/n binary image on the Bulk-Synchronous Parallel (BSP) model. The first algorithm is for weighted distance, and the second algorithm is for L/sub p/ distance. Both algorithms run in O(n/sup 2//p+L) computation time and O(g/sup n///spl radic/p+L) communication time using p (1/spl les/p/spl les/n) processors and in O(n/sup 2//p+(d+L)log p/n/log(d+1)) computation time and in O(gn//spl radic/p+(gd+L)log p/n/log(d+1)) communication time using p (n<p/spl les/n/sup 2/) processors, for any integer d (1/spl les/d/spl les/p/n), where L denotes synchronization periodicity and g denotes a reciprocal of communication bandwidth.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124512474","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
/spl Psi/-cubes: recursive bused fat-hypercubes for multilevel snoopy caches /spl Psi/-cubes:用于多级snoopy缓存的递归总线fat-hypercubes
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778918
Masaru Takesue
{"title":"/spl Psi/-cubes: recursive bused fat-hypercubes for multilevel snoopy caches","authors":"Masaru Takesue","doi":"10.1109/ISPAN.1999.778918","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778918","url":null,"abstract":"The paper proposes a /spl Psi/-cube network that consists of low-height trees of buses desirable for the coherence directories of multilevel snoopy caches. Since the /spl Psi/-cube is organized based on a recurrence of the Hamming codes, it has recursive levels, each of bused fat-hypercubes, named /spl psi/-cubes. A /spl psi/-cube is composed of the clusters that are produced by partitioning the nodes with multiple suits of codewords of a Hamming code. Thus every node is the representative node of a unique cluster, while its other nodes have addresses equal to single-bit or detectable double-bit error words of the node's address. The nodes are connected to a bus in the cluster, so that the /spl Psi/-cube configures trees of buses that has the height determined by the recurrence.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131206943","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
Cluster technologies for high performance computing 用于高性能计算的集群技术
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778934
M. Ishii
{"title":"Cluster technologies for high performance computing","authors":"M. Ishii","doi":"10.1109/ISPAN.1999.778934","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778934","url":null,"abstract":"A cluster system is extending its ability, owing to the increase of transmission speed and interface speed between nodes and interconnect. Synfinity interconnect can carry out the routing and transfer the massages at the speed of gigabyte/s. The bottleneck problem raised in a conventional cluster system must be solved by improvements such as transmission speed and protocol. Based on the standard interface, any kind of commodity like the latest PCs, WSs and SMPs can be applied as a node computer. That makes the cluster system more attractive from the point of view of availability, usability, flexibility, scalability and cost performance. Moreover, a parallel program on the cluster system can be written by using a newly-developed message communication library, without paying any attention to the communication between inter- and intra-node. The cluster system will be also used instead of a parallel computer, MPP and the so called supercomputer, and it has new features of shared memory view.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"4 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122650387","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
Models and algorithms for optical and optoelectronic parallel computers 光学与光电并行计算机的模型与算法
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778909
S. Sahni
{"title":"Models and algorithms for optical and optoelectronic parallel computers","authors":"S. Sahni","doi":"10.1109/ISPAN.1999.778909","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778909","url":null,"abstract":"This paper briefly reviews some of the more popular parallel computer models - pipelined optical bus and OTIS (optical transpose interconnect system) models - that employ optical interconnects. The interconnect topology and some simple algorithms for each model are also described.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122413832","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}
引用次数: 21
Powerful and feasible processor interconnections with an evaluation of their communications capabilities 强大可行的处理器互连，并对其通信能力进行评估
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778943
Qian Wang, Sotirios G. Ziavras
{"title":"Powerful and feasible processor interconnections with an evaluation of their communications capabilities","authors":"Qian Wang, Sotirios G. Ziavras","doi":"10.1109/ISPAN.1999.778943","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778943","url":null,"abstract":"Scalable networks with very good topological properties are often impossible to build because of their prohibitively high wiring complexity. Such a network is the generalized hypercube (GH). It supports full-connectivity of all its nodes in each dimension and is characterized by outstanding topological properties. We propose a new class of scalable interprocessor connections, namely HOWs (Highly-Overlapping Windows), capable of lower complexity than GHs and comparable performance. HOWs are obtained from GHs by removing edges to produce systems of lower wiring complexity. They contain numerous highly-overlapping GHs of smaller size. The classical GH belongs to this new class of interconnections. We demonstrate that 2-DHOWs perform much better than binary hypercubes for important communications patterns.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"83 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127975263","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 architecture for high speed fractal image coding 高速分形图像编码的并行结构
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778922
Shinhaeng Lee, H. Aso
{"title":"A parallel architecture for high speed fractal image coding","authors":"Shinhaeng Lee, H. Aso","doi":"10.1109/ISPAN.1999.778922","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778922","url":null,"abstract":"The main problem of fractal image compression is the long search time of the domain pool. For this reason, the dedicated ASIC architecture for fractal image coding is needed. In this paper, we propose an efficient parallel architecture for fractal image coding which is based on fixed-size full-search algorithm. One of the main features of this architecture is that it uses only local communication such that each processor has a range and a domain block which is shifted to the next processor. Another main feature is that it has very regular interconnections and data flow. Domain blocks are formed from the range blocks in processors and the encoding procedure is performed by the regular data flow of domain blocks into the other processors. Each processor performs the fast isometric transformations which are calculated by one full rotation around the center.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129041050","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 new look at multimedia synchronization in distributed environments 分布式环境中多媒体同步的新视角
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778959
Zhonghua Yang, Chengzheng Sun, A. Sattar, Yanyan Yang
{"title":"A new look at multimedia synchronization in distributed environments","authors":"Zhonghua Yang, Chengzheng Sun, A. Sattar, Yanyan Yang","doi":"10.1109/ISPAN.1999.778959","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778959","url":null,"abstract":"A multimedia system requires to handle automatically and uniformly the generation, manipulation, presentation, storage, and communication of independent discrete and continuous media data. The synchronization between various kinds of media data is a key issue in an integrated multimedia system, and has drawn a considerable attention. In this paper we investigate the synchronization problem in distributed multimedia environments and propose a new approach. Based on a globally synchronized clock, we present an isochronous clock-driven protocol for multimedia synchronization in a distributed environment. We show that the isochronous approach is simple, easy to understand, and more importantly, can guarantee the temporal ordering (including causal order and /spl Delta/-causal order). We believe that with the new developments in the improved NTP over Internet and very high accuracy of synchronized clocks over ATM and LANs, the clock-based distributed synchronization would provide a promising, yet simple and intuitive, alternative to the existing approaches.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117008839","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
Dynamic computation scheduling for load balancing in home-based software DSMs 基于家庭的软件dsm中负载均衡的动态计算调度
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778947
Weisong Shi, Zhimin Tang
{"title":"Dynamic computation scheduling for load balancing in home-based software DSMs","authors":"Weisong Shi, Zhimin Tang","doi":"10.1109/ISPAN.1999.778947","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778947","url":null,"abstract":"Load balancing is a critical issue for achieving good performance in parallel and distributed systems. However, this issue is neglected in the research area of software DSMs in the past decade. In this paper, we present and evaluate a dynamic computation scheduling scheme for load balancing of iterative applications in software DSM system. The experiment platform is a home based DSM system named JIAJIA. Preliminary results show that this load balancing scheme is efficient and can be used in other software DSM systems. Compared with simple chunk self scheduling scheme which works well for single iteration applications, the system performance is improved by about 30% with the affinity-based self scheduling proposed in this paper.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133566752","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
首页 上一页 下一页 尾页
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学术官方微信
小红书