Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)最新文献

The Augmented Composite Banyan Network 增强复合榕树网络

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.738000

Hyoung-Il Lee, S. Seo, T. Feng

{"title":"The Augmented Composite Banyan Network","authors":"Hyoung-Il Lee, S. Seo, T. Feng","doi":"10.1109/HIPC.1998.738000","DOIUrl":"https://doi.org/10.1109/HIPC.1998.738000","url":null,"abstract":"A new multipath multistage interconnection network called the Augmented Composite Banyan Network (ACBN) is proposed. The ACBN is created by adding a link to each SE of the Composite Banyan Network (CBN), which is a multipath network with at least two disjoint paths and was originally proposed in (Seo and Feng, 1995). Therefore, the basic building blocks in the ACBN are 4/spl times/4 SEs with log/sub 2/N stages. The ACBN inherits the favorable features of the CBN such as regularity, symmetry and easy rerouting capability under faults and conflicts. The ACBN also has an efficient and fast control algorithm that can easily generate a primary routing tag and alternative routing tags as in the CBN. A major improvement of the ACBN over the CBN is the higher connectivity with four disjoint paths between any source and destination pair. Moreover the ACBN can generate alternative routing tags in a much simpler way i.e., by a simple binary operation not by the conversion table as in the CBN. To compare the ACBN with other networks in connectivity, we introduce the definition of a degree of connectivity as a new connectivity measure function. The comparison results show that due to high connectivity the ACBN can resolve more random connection requests than other networks by using only a small amount of additional hardware.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116976015","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 skeletonization algorithm and its VLSI architecture 一种并行骨架化算法及其VLSI结构

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.737972

N. Sudha, Sukumar Nandi

引用次数: 1

Apportioning: a technique for efficient reachability analysis of concurrent object-oriented programs 分配:一种对并发面向对象程序进行有效可达性分析的技术

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.737980

S. Iyer, S. Ramesh

{"title":"Apportioning: a technique for efficient reachability analysis of concurrent object-oriented programs","authors":"S. Iyer, S. Ramesh","doi":"10.1109/HIPC.1998.737980","DOIUrl":"https://doi.org/10.1109/HIPC.1998.737980","url":null,"abstract":"The object-oriented paradigm has been found to be useful for the construction of large and complex concurrent systems. Reachability analysis is an important and well-known tool for static (pre-run-time) analysis of concurrent programs. However, direct application of traditional reachability analysis to concurrent object-oriented programs has many problems, such as incomplete analysis for reusable classes (not safe) and increased computational complexity (not efficient). We have proposed a novel technique called apportioning, for effective reachability analysis of concurrent object-oriented programs, that integrates the techniques of abstraction (considering a reduced representation of the system) and partitioning (dividing the system into smaller units). The given program is apportioned into a reduced version of each of its classes, as well as a reduced version of the program. The error to be checked is also decomposed into appropriate sub-properties for checking in the reachability graphs corresponding to the apportioned program. We have developed a number of apportioning-based algorithms, having different degrees of safety and effectiveness. In this paper, we present the details of one of these algorithms.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115013661","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

Executing serializable transactions within a hard real-time database system 在硬实时数据库系统中执行可序列化的事务

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.738015

S. Bhalla

引用次数: 8

A conservative parallel simulation algorithm for entity-oriented modeling 面向实体建模的保守并行仿真算法

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.738018

C. Lim, M. Low, Boon-Ping Gan

引用次数: 2

An improved parallel disk scheduling algorithm 一种改进的并行磁盘调度算法

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.738012

M. Kallahalla, P. Varman

引用次数: 2

New number representation and conversion techniques on reconfigurable mesh 基于可重构网格的数字表示与转换新技术

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.737964

A. Bertossi, A. Mei

引用次数: 2

Processor allocation using user directives in mesh-connected multicomputer systems 网格连接多计算机系统中使用用户指令的处理器分配

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.738002

Chung-Yen Chang, P. Mohapatra

引用次数: 2

Efficient algorithms for delay-bounded minimum cost path problem in communication networks 通信网络延迟有界最小代价路径问题的有效算法

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.737982

G. Kumar, Nishit Narang, C. Ravikumar

{"title":"Efficient algorithms for delay-bounded minimum cost path problem in communication networks","authors":"G. Kumar, Nishit Narang, C. Ravikumar","doi":"10.1109/HIPC.1998.737982","DOIUrl":"https://doi.org/10.1109/HIPC.1998.737982","url":null,"abstract":"As the amount of data transmitted over a network increases and high bandwidth applications requiring point to multipoint communications like videoconferencing, distributed database management or cooperative work become widespread, it becomes very important to optimize network resources. One such optimization is multicast tree generation. The problem of generating a minimum cost multicast tree given the network topology and costs associated with the connecting links can be modelled as a Steiner tree problem which is NP-complete. Much work has been done in the direction of obtaining near-optimal multicast trees when the objective is only to minimize the cost. However, many real time applications such as videoconferencing require that data be sent within prespecified delay limits in order to avoid problems such as anachronism and lack of synchronization. We deal with the delay-bounded cost-optimal multicast tree (DBCPAT) generation problem. Specifically, we discuss a closely related problem which is to find a delay-bounded cost-optimal path (DBCP) between a specified source and destination node. Such a path can be used as a starting point to solve the DBCMT. We present an exact solution to the DBCP which is based on the branch-and-bound paradigm. We also propose a heuristic technique to solve the DBCP using the principle of evolutionary computing. The results obtained using the two techniques are compared for several large networks.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"39 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132393676","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 passing support on StarT-Voyager StarT-Voyager上的消息传递支持

Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.737993

B. S. Ang, Derek Chiou, L. Rudolph, Arvind

引用次数: 28