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

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

筛选
英文 中文
WADE: a Web-based automated parallel CAD environment WADE:一个基于web的自动化并行CAD环境
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.738024
Dhruva R. Chakrabarti, P. Joisha, J. Chandy, Krishnaswamy Krishnaswamy, V. Krishnaswamy, P. Banerjee
{"title":"WADE: a Web-based automated parallel CAD environment","authors":"Dhruva R. Chakrabarti, P. Joisha, J. Chandy, Krishnaswamy Krishnaswamy, V. Krishnaswamy, P. Banerjee","doi":"10.1109/HIPC.1998.738024","DOIUrl":"https://doi.org/10.1109/HIPC.1998.738024","url":null,"abstract":"We present a novel framework of a Web-based automated parallel CAD environment. The goal of this project is to make available to the CAD community a growing number of design and test applications that support standard interfaces and execute efficiently in a parallel environment. The design files of a user working on a remote machine are transparently shipped to the local Compute Center, the relevant computation is performed in a parallel environment and then the results are returned back to the user. A job submission and scheduling tool ensures proper load balance and maximal usage of the various parallel machines. The whole process is done efficiently and transparently without the user having to bother about any low-level details. At present, a number of parallel CAD tools including a placement tool, a fault simulator and a VHDL simulator are supported. Results from a preliminary implementation are impressive and show the feasibility of the approach.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"178 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":"114848065","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
Available parallelism with data value prediction 数据值预测的可用并行性
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.737989
Rahul Sathe, M. Franklin
{"title":"Available parallelism with data value prediction","authors":"Rahul Sathe, M. Franklin","doi":"10.1109/HIPC.1998.737989","DOIUrl":"https://doi.org/10.1109/HIPC.1998.737989","url":null,"abstract":"Data dependences (data flow constraints) present a major hurdle to the amount of instruction-level parallelism that can be exploited from a program. Recent work has focused on the use of data value prediction to overcome the limits imposed by data dependences. That is, when an instruction is fetched, its result can be predicted so that subsequent instructions that depend on the result can execute earlier using the predicted value. When the correct result becomes available, it is compared against the value predicted earlier, so as to validate the prediction. Whereas significant work has been done towards developing schemes for accurately predicting data values, not much work has been done towards understanding and quantifying the performance impact of data value prediction. This paper presents a quantitative study of the impact of data value prediction on available parallelism. Our studies, done with the MIPS instruction set and a collection of SPEC95 integer benchmarks, show that data value prediction provides significant increases in available parallelism when infinite size instruction window and perfect branch prediction are used. Our studies with finite size windows shows that the impact of data value prediction is not very significant for small window sizes such as 64. When the instruction window size is increased, the benefits of data value prediction become more apparent.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"37 3 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":"115300355","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
Piecewise fixed-rate retrieval scheme for variable bit rate video 可变比特率视频的分段固定速率检索方案
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.738022
Sunghoon Son, K. Koh
{"title":"Piecewise fixed-rate retrieval scheme for variable bit rate video","authors":"Sunghoon Son, K. Koh","doi":"10.1109/HIPC.1998.738022","DOIUrl":"https://doi.org/10.1109/HIPC.1998.738022","url":null,"abstract":"We consider the retrieval of variable bit rate (VBR) video from the distributed video server. Video servers often employ the constant rate retrieval scheme, in which a fixed amount of disk bandwidth is reserved throughout the retrieval to guarantee the continuous playback requirement. In constant rate retrieval, the allocated disk bandwidth is not always fully utilized in order to avoid excessive prefetch buffer requirement. This results in poor disk bandwidth utilization. We present a novel retrieval algorithm for stored variable bit rate video called piecewise fixed rate retrieval scheme. This scheme divides the total retrieval duration into several intervals during which a constant amount of disk bandwidth is reserved in order to maximize the disk bandwidth utilization. We examine the effectiveness of the retrieval scheme through extensive simulation studies. Compared to existing retrieval schemes, piecewise fixed rate retrieval achieves the greatest reduction in retrieval rate variability of disk bandwidth allocated, and results in high disk bandwidth utilization.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"18 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":"125324274","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 algorithms for vehicle routing problems 车辆路径问题的并行算法
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.737986
K. J. Madhu, Sanjeev Saxena
{"title":"Parallel algorithms for vehicle routing problems","authors":"K. J. Madhu, Sanjeev Saxena","doi":"10.1109/HIPC.1998.737986","DOIUrl":"https://doi.org/10.1109/HIPC.1998.737986","url":null,"abstract":"In a complete directed weighted graph there are jobs located at nodes of the graph. Job i has an associated processing time or handling time h/sub i/, and the job must start within a prespecified time window [r/sub i/, d/sub i/]. A vehicle can move on the arcs of the graph, at unit speed and that has to execute the jobs within their respective time windows. We consider three different problems on the CREW PRAM. (1) Find the minimum cost routes between all pairs of nodes in a network. We give an O(log/sup 3/ n) time algorithm with n/sup 4//log/sup 2/ n processors. (2) Services all locations in minimum time. The general problem is NP-complete but O(n/sup 2/) time algorithms are known for a special case; for this case we obtain an O(log/sup 3/ n) time parallel algorithm using n/sup 4//log/sup 2/ n processors and a linear time optimal parallel algorithm. (3) Minimize the sum of waiting times at all locations. The general problem is NP-complete but O(n/sup 2/) time algorithm are known for a special case; for this case, we obtain an O(log/sup 2/ n) time algorithm with n/sup 3//log n processors and also a linear time optimal parallel algorithm.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"35 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":"126054107","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
A clustering approach in characterizing interconnection networks 表征互联网络的聚类方法
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.737999
W. Ho, T. Pinkston
{"title":"A clustering approach in characterizing interconnection networks","authors":"W. Ho, T. Pinkston","doi":"10.1109/HIPC.1998.737999","DOIUrl":"https://doi.org/10.1109/HIPC.1998.737999","url":null,"abstract":"Networks of workstations (NOW) have gained importance in recent years. The interconnection network of NOW systems often consist of generic switches connected in an irregular topology. Traditionally, interconnection networks are characterized by their topological properties, such as number of nodes, diameter, and bisection width. These parameters are not sufficient in characterizing irregular networks. This research puts forth a new approach that characterizes both regular and irregular networks. A partitioning algorithm is proposed to break down a network topology into groups or clusters of nodes such that there is higher bandwidth within clusters than between clusters. By doing so, the potential bottlenecks of a network are identified. Furthermore, a characterization scheme based on measurement of these clusters is defined. The new scheme uses two parameters, the intercluster bandwidth index and intercluster link cost index to describe a network topology. Simulation results show that these two indices have stronger correlation to performance than traditional topological properties.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"1 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":"130089722","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
Broadcasting on a budget in the multi-service communication model 在多业务通信模型中按预算广播
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.737985
G. Itkis, I. Newman, A. Schuster
{"title":"Broadcasting on a budget in the multi-service communication model","authors":"G. Itkis, I. Newman, A. Schuster","doi":"10.1109/HIPC.1998.737985","DOIUrl":"https://doi.org/10.1109/HIPC.1998.737985","url":null,"abstract":"In this paper we introduce the MULTI_SERVICE model of network communication. This model attempts to capture recent communication technology trends, such as aspects of quality-of-service and their relation to the emerging technology of automatic pricing, e.g. for Internet services. The MULTI_SERVICE model differs from related models by taking communication and service activation time into account, thus restricting parallelism to better fit reality. Thus, our model extends and refines previous successful models for network communication. We consider the application of this model to communication problems, where the services are certain communication media or connection providers, with respective pricing policies. We give some insights and an algorithm for optimal dissemination of information in this model when given a fixed, limited budget.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"40 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":"121660254","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
GLB: a low-cost scheduling algorithm for distributed-memory architectures GLB:分布式内存架构的低成本调度算法
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.738001
A. Radulescu, A. V. Gemund
{"title":"GLB: a low-cost scheduling algorithm for distributed-memory architectures","authors":"A. Radulescu, A. V. Gemund","doi":"10.1109/HIPC.1998.738001","DOIUrl":"https://doi.org/10.1109/HIPC.1998.738001","url":null,"abstract":"This paper proposes a new compile time scheduling algorithm for distributed-memory systems, called Global Load Balancing (GLB). GLB is intended as the second step in the multi-step class of scheduling algorithms. Experimental results show that compared with known scheduling algorithms of the same low-cost complexity, the proposed algorithm improves schedule lengths up to 30%. Compared to algorithms with higher order complexities, the typical schedule lengths obtained with the proposed algorithm are at most twice longer.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"64 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":"132902556","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}
引用次数: 10
Near optimal algorithms for scheduling independent chains in BSP BSP中独立链调度的近最优算法
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.738003
A. Goldman, G. Mounié, D. Trystram
{"title":"Near optimal algorithms for scheduling independent chains in BSP","authors":"A. Goldman, G. Mounié, D. Trystram","doi":"10.1109/HIPC.1998.738003","DOIUrl":"https://doi.org/10.1109/HIPC.1998.738003","url":null,"abstract":"The aim of this work is to show that scheduling a set of independent chains on a parallel machine under the BSP model is a difficult optimization problem which can be easily approximated in practice. BSP is a machine independent computational model which is becoming more and more popular. Finding the optimal solution when the number of processors is fixed is shown to be hard. Efficient heuristics including communications are proposed and analyzed. We particularly focus on the influence of synchronization between consecutive supersteps. Simulations of a large number of instances have been carried out to complement the theoretical worst case analysis. They confirm the very good behaviour of the algorithm on average.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"236 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":"123039661","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}
引用次数: 5
Control flow prediction with unbalanced tree-like subgraphs 不平衡树状子图控制流预测
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.737992
B. Toone, M. Franklin
{"title":"Control flow prediction with unbalanced tree-like subgraphs","authors":"B. Toone, M. Franklin","doi":"10.1109/HIPC.1998.737992","DOIUrl":"https://doi.org/10.1109/HIPC.1998.737992","url":null,"abstract":"In order to fetch a large number of instructions per cycle from a sequential program, wide-issue superscalar processors have to predict the outcome of multiple branches in a cycle, and fetch instructions from non-contiguous portions of code. Past research has developed schemes that predict the outcome of multiple branches by means of a single prediction. That is, instead of predicting the outcome of every conditional branch, a tree-like subgraph of the control flow graph of the executed program is considered as a single prediction unit, and a path is predicted through the tree, thereby allowing the superscalar fetch mechanism to go past multiple branches per cycle. This paper investigates the potential of dynamically modifying the tree structure by pruning the rarely seen paths and extending the frequently seen paths, so as to increase the average fetch size. It discusses the procedure used for tree modifications, and presents the path length and prediction accuracy obtainable with this approach using the SPEC '95 integer benchmarks and the MIPS instruction set.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"115 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":"115176448","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
Computation of penetration measures for convex polygons and polyhedra for graphics applications 图形应用中凸多边形和多面体穿透度量的计算
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238) Pub Date : 1998-12-17 DOI: 10.1109/HIPC.1998.737974
K. Sridharan
{"title":"Computation of penetration measures for convex polygons and polyhedra for graphics applications","authors":"K. Sridharan","doi":"10.1109/HIPC.1998.737974","DOIUrl":"https://doi.org/10.1109/HIPC.1998.737974","url":null,"abstract":"Algorithms to compute measures of penetration between convex polygonal objects in /spl Rfr//sup 2/ and convex polyhedral objects in /spl Rfr//sup 3/ are presented. The algorithms are analyzed for their asymptotic complexity. Details of implementation on a single processor machine are given. Parallelization of the algorithms is discussed.","PeriodicalId":175528,"journal":{"name":"Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)","volume":"9 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":"124316029","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信