Int. J. High Speed Comput.最新文献_第2页

Performance Analysis of k-Ary n-Cube Networks with Pipelined Circuit Switching 基于流水线电路交换的k-Ary n-Cube网络性能分析

Int. J. High Speed Comput. Pub Date : 2000-06-01 DOI: 10.1142/S0129053300000102

G. Min, H. Sarbazi-Azad, M. Ould-Khaoua

引用次数: 7

Overhead Reduction in the Network Communication for Web Computing Web计算中网络通信开销的降低

Int. J. High Speed Comput. Pub Date : 2000-06-01 DOI: 10.1142/S0129053300000114

Juil Oh, Ju-wook Jang, T. Han

{"title":"Overhead Reduction in the Network Communication for Web Computing","authors":"Juil Oh, Ju-wook Jang, T. Han","doi":"10.1142/S0129053300000114","DOIUrl":"https://doi.org/10.1142/S0129053300000114","url":null,"abstract":"One major source of overhead for conventional network communication is the involvement of operating system to allow for virtual sharing of the network interface card among applications and its processing of the UDP/TCP/IP headers on behalf of applications. The involvement of operating system results in overheads such as extra write/read operations to the kernel buffer through which each inbound/outbound messages should pass. Another overhead comes from scheduling which may hinder immdiate sending or receiving of messages to and from network interface buffer. Recently, U-Net over Fast Ethernet [9] addressed this problem and proposed a new scheme which circumvents the operating system in processing the network communication. However, since the approach has removed IP header and provides multiplexing in the ethernet layer, it is only applicable to an ethernet LAN. In this paper, we define a new protocol by which messages are allowed to move across routers and the virtual sharing of network interface card is supported with minimal overhead. In a word, we extended the U-Net over Fast Ethernet [9] beyond routers to WAN and hence opening a new way to exploit vast amount of computing resources all over Internet. With our protocol, cluster computing over any part of WAN is realizable as far as total delay caused by intervening routers is tolerable to the application. As a justification of our approach, we show a small part of WAN containing a router exhibits latency comparable to (differ by less than 1 ms) that of a shared ethernet. Another motivation for our approach is the observation that the aggregate bandwidth of two subnets (part of WAN) is greater than that of a single subnet (LAN). With same number of hosts, each connection will experience more available bandwidth with the part of WAN than the LAN. The experiment over WAN involving a router shows reduction of latency comparable to that of U-Net over Fast Ethernet.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121998874","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

Parallel Performance of Fast Wavelet Transforms 快速小波变换的并行性能

Int. J. High Speed Comput. Pub Date : 2000-03-01 DOI: 10.1142/S0129053300000059

O. M. Nielsen, M. Hegland

引用次数: 41

Parallel Spectral Division Using the Matrix Sign Function for the Generalized Eigenproblem 广义特征问题的矩阵符号函数并行谱划分

Int. J. High Speed Comput. Pub Date : 2000-03-01 DOI: 10.1142/S0129053300000084

S. Huss-Lederman, E. S. Quintana‐Ortí, Xiaobai Sun, Yuan-Jye J. Wu

引用次数: 10

The Vector Multiprocessor 矢量多处理器

Int. J. High Speed Comput. Pub Date : 2000-03-01 DOI: 10.1142/S0129053300000060

P. Swarztrauber

{"title":"The Vector Multiprocessor","authors":"P. Swarztrauber","doi":"10.1142/S0129053300000060","DOIUrl":"https://doi.org/10.1142/S0129053300000060","url":null,"abstract":"The Vector Multiprocessor brings to the multiprocessor what vectorization brought to the single processor. In addition to the usual complement of logic and arithmetic units, each processor contains a programmable communication unit with registers that communicate directly with comparable registers in neighboring processors via an n-dimensional interconnection network. Interprocessor communication tasks are performed to and from these registers in the same way that computational tasks are performed on a vector uniprocessor. Communication is shown to be optimal for a large class of communication tasks. Elements are transmitted, in parallel, to their destination processors at an average rate of one per communication cycle. This result, called O(1) access, is used to develop a balanced communication system where local and global access are comparable. It is also used to support the \"vector parallel paradigm\" where all arrays are uniformly distributed and the user interface \"looks\" like a vector uniprocessor interface. Both coarse- and fine-grain performance models are provided, which demonstrate the unexpected result that communication is asymptotically negligible compared to computational time. Finally, three performance models are presented for the spherical harmonic transform, which is the most communication-intensive part of climate model dynamics.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"613 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123340108","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

Path Selection for Real-Time Communication in Wormhole Networks 虫洞网络中实时通信的路径选择

Int. J. High Speed Comput. Pub Date : 1999-12-01 DOI: 10.1142/S012905339900017X

Kyungwan Nam, Sunggu Lee, Jong Kim

引用次数: 6

Balanced Generalized Hypercubes: Complexity and Cost/Performance Analysis 平衡广义超立方体:复杂性和成本/性能分析

Int. J. High Speed Comput. Pub Date : 1999-12-01 DOI: 10.1142/S0129053399000193

L. Lin

引用次数: 0

Parallel Implementation of Alternate Quadrant Interlocking Factorisation Method on Star Topology 星型拓扑上交替象限联锁分解方法的并行实现

Int. J. High Speed Comput. Pub Date : 1999-12-01 DOI: 10.1142/S0129053399000181

B. Prameela, L. Patnaik

引用次数: 0

Balanced Generalized Hypercubes: Optimal Communication Algorithms 平衡广义超立方体:最优通信算法

Int. J. High Speed Comput. Pub Date : 1999-12-01 DOI: 10.1142/S012905339900020X

L. Lin

引用次数: 0

An Improved Lempel-Ziv Algorithm for Sequential Data Compression 一种改进的序列数据压缩Lempel-Ziv算法

Int. J. High Speed Comput. Pub Date : 1999-09-01 DOI: 10.1142/S0129053399000132

S. K. Jena

引用次数: 0