Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)最新文献

筛选
英文 中文
Design of a framework for data-intensive wide-area applications 数据密集型广域应用的框架设计
Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556) Pub Date : 2000-05-01 DOI: 10.1109/HCW.2000.843737
M. Beynon, T. Kurç, A. Sussman, J. Saltz
{"title":"Design of a framework for data-intensive wide-area applications","authors":"M. Beynon, T. Kurç, A. Sussman, J. Saltz","doi":"10.1109/HCW.2000.843737","DOIUrl":"https://doi.org/10.1109/HCW.2000.843737","url":null,"abstract":"Applications that use collections of very large, distributed datasets have become an increasingly important part of science and engineering. With high performance wide-area networks becoming more pervasive, there is interest in making collective use of distributed computational and data resources. Recent work has converged to the notion of the Grid, which attempts to uniformly present a heterogeneous collection of distributed resources. Current Grid research covers many areas from low level infrastructure issues to high level application concerns. However providing support for efficient exploration and processing of very large scientific datasets stored in distributed archival storage systems remains a challenging research issue. We have initiated an effort that focuses on developing efficient data-intensive applications in a Grid environment. We present a framework, called filter-stream programming, that represents the processing units of a data-intensive application as a set of filters, which are designed to be efficient in their use of memory and scratch space. We describe a prototype infrastructure that supports execution of applications wing the proposed framework. We present the implementation of two applications using the filter-stream programming framework, and discuss experimental results demonstrating the effects of heterogeneous resources on application performance.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134000883","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}
引用次数: 55
Heterogeneity as key feature of high performance computing: the PQE1 prototype 异构是高性能计算的关键特征:PQE1原型
Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556) Pub Date : 2000-05-01 DOI: 10.1109/HCW.2000.843729
P. Palazzari, L. Arcipiani, M. Celino, R. Guadagni, A. Marongiu, A. Mathis, P. Novelli, V. Rosato
{"title":"Heterogeneity as key feature of high performance computing: the PQE1 prototype","authors":"P. Palazzari, L. Arcipiani, M. Celino, R. Guadagni, A. Marongiu, A. Mathis, P. Novelli, V. Rosato","doi":"10.1109/HCW.2000.843729","DOIUrl":"https://doi.org/10.1109/HCW.2000.843729","url":null,"abstract":"Presents the results of a project aimed at assembling a hybrid massively parallel machine, the PQE1 prototype, which is devoted to the simulation of complex physical models. The analysis of some existing parallel architectures has revealed that general-purpose machines are largely over-dimensioned and often perform inefficiently in grand-challenge scientific applications. We have thus developed a heterogeneous parallel system which matches task heterogeneity with architecture heterogeneity: in fact, special-purpose massively parallel architectures, when coupled to general-purpose machines, are able to satisfy the requirements of complex scientific computing efficiently. We present the hardware structure and the software tools that have been developed for the PQE1 prototype. Starting from the concepts of machine granularity and task granularity, we show the necessity to exploit both high- and low-granularity parallelism in order to use the PQE1 system efficiently. Some examples showing application fields in which the PQE1 prototype has been successfully used are briefly described.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124411288","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
Optimising heterogeneous task migration in the Gardens virtual cluster computer 在Gardens虚拟集群计算机中优化异构任务迁移
Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556) Pub Date : 2000-05-01 DOI: 10.1109/HCW.2000.843739
A. Beitz, Simon D. Kent, P. Roe
{"title":"Optimising heterogeneous task migration in the Gardens virtual cluster computer","authors":"A. Beitz, Simon D. Kent, P. Roe","doi":"10.1109/HCW.2000.843739","DOIUrl":"https://doi.org/10.1109/HCW.2000.843739","url":null,"abstract":"Gardens is an integrated programming language and system designed to support parallel computing across nondedicated cluster computers, in particular networks of PCs. To utilise non-dedicated machines a program must adapt to those currently available. In Gardens this is realised by over decomposing a program into more tasks than processors, and migrating tasks to implement adaptation. To be effective this requires efficient task migration. Furthermore, typically non-dedicated clusters contain different machines hence heterogeneous task migration is required. Gardens supports efficient task migration between heterogeneous machines via meta-information which completely describes a task's state. By identifying different degrees of heterogeneity and different kinds of tasks, we are able to optimise task migration. The main contribution is to show how heterogeneous task migration may be optimised.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125187011","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
Segmented min-min: a static mapping algorithm for meta-tasks on heterogeneous computing systems 分段最小最小:异构计算系统上元任务的静态映射算法
Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556) Pub Date : 2000-05-01 DOI: 10.1109/HCW.2000.843759
Minyou Wu, W. Shu, Hong Zhang
{"title":"Segmented min-min: a static mapping algorithm for meta-tasks on heterogeneous computing systems","authors":"Minyou Wu, W. Shu, Hong Zhang","doi":"10.1109/HCW.2000.843759","DOIUrl":"https://doi.org/10.1109/HCW.2000.843759","url":null,"abstract":"The min-min algorithm is a simple algorithm. It runs fast and delivers good performance. However, the min-min algorithm schedules small tasks first, resulting in some load imbalance. We present an algorithm which improves the min-min algorithm by scheduling large tasks first. The new algorithm, segmented min-min, balances the load well and demonstrates even better performance in both makespan and running time.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"5 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120851483","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}
引用次数: 161
Parallel program execution on a heterogeneous PC cluster using task duplication 使用任务复制在异构PC集群上并行执行程序
Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556) Pub Date : 2000-05-01 DOI: 10.1109/HCW.2000.843758
Yu-Kwong Kwok
{"title":"Parallel program execution on a heterogeneous PC cluster using task duplication","authors":"Yu-Kwong Kwok","doi":"10.1109/HCW.2000.843758","DOIUrl":"https://doi.org/10.1109/HCW.2000.843758","url":null,"abstract":"We propose to use a duplication based approach in scheduling tasks for a heterogeneous cluster of PCs. In duplication based scheduling, critical tasks are redundantly scheduled to more than one machine in order to reduce the number of inter-task communication operations. The start times of the succeeding tasks are also reduced. The task duplication process is guided given the system heterogeneity in that the critical tasks are scheduled or replicated in faster machines. The algorithm has been implemented in our prototype program parallelization tool for generating MPI code executable on a cluster of Pentium PCs. Our experiments using three applications have indicated that the heterogeneity of a PC cluster, being an inevitable feature, is indeed useful for optimizing the execution of parallel programs.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117269890","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}
引用次数: 22
A heuristic algorithm for mapping communicating tasks on heterogeneous resources 异构资源上通信任务映射的启发式算法
Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556) Pub Date : 2000-05-01 DOI: 10.1109/HCW.2000.843736
K. Taura, A. Chien
{"title":"A heuristic algorithm for mapping communicating tasks on heterogeneous resources","authors":"K. Taura, A. Chien","doi":"10.1109/HCW.2000.843736","DOIUrl":"https://doi.org/10.1109/HCW.2000.843736","url":null,"abstract":"A heuristic algorithm that maps data processing tasks onto heterogeneous resources (i.e. processors and links of various capacities) is presented. The algorithm tries to achieve a good throughput of the whole data processing pipeline, taking both parallelism (load balance) and communication volume (locality) into account. It performs well both under computationally intensive and communication-intensive conditions. When all tasks/processors are of the same size and communication is negligible, it quickly distributes the computation load over the processors and finds the optimal mapping. As communication becomes significant and reveals a bottleneck, it trades parallelism for reduction of communication traffic. Experimental results using a topology generator that models the Internet show that it performs significantly better than communication-ignorant schedulers.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114578618","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}
引用次数: 115
Fast and effective task scheduling in heterogeneous systems 异构系统中快速有效的任务调度
Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556) Pub Date : 2000-05-01 DOI: 10.1109/HCW.2000.843747
A. Radulescu, A. V. Gemund
{"title":"Fast and effective task scheduling in heterogeneous systems","authors":"A. Radulescu, A. V. Gemund","doi":"10.1109/HCW.2000.843747","DOIUrl":"https://doi.org/10.1109/HCW.2000.843747","url":null,"abstract":"Recently (Proc. ACM Int. Conf. on Supercomput., 1999), we presented two very low-cost approaches to compile-time list scheduling where the tasks' priorities are computed statically or dynamically. For homogeneous systems, these two algorithms, called FCP (Fast Critical Path) and FLB (Fast Load Balancing), respectively, have been shown to yield a performance equivalent to other much more costly algorithms, such as MCP and ETF (Earliest Task First). In this paper, we present modified versions of FCP and FLB targeted at heterogeneous systems. We show that the modified versions yield a good overall performance, which is generally comparable to algorithms specifically designed for heterogeneous systems, such as HEFT (Heterogeneous Earliest Finish Time) or ERT (which are versions of MCP and ETF, respectively, using the task's completion time as the task priority). There are a few cases, mainly for irregular problems and large processor speed variance, where FCP's and FLB's performances drop to 32% and 63%, respectively. Considering the good overall performance and their very low cost, however, FCP and FLB are interesting options for scheduling very large problems on heterogeneous systems.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114812870","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}
引用次数: 144
Load balancing across near-homogeneous multi-resource servers 跨几乎同构的多资源服务器的负载平衡
Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556) Pub Date : 2000-05-01 DOI: 10.1109/HCW.2000.843733
William Leinberger, G. Karypis, Vipin Kumar
{"title":"Load balancing across near-homogeneous multi-resource servers","authors":"William Leinberger, G. Karypis, Vipin Kumar","doi":"10.1109/HCW.2000.843733","DOIUrl":"https://doi.org/10.1109/HCW.2000.843733","url":null,"abstract":"An emerging model for computational grids interconnects similar multi-resource servers from distributed sites. A job submitted to the grid can be executed by any of the servers; however, resource size or balance may be different across servers. One approach to resource management for this grid is to layer a global load distribution system on top of the local job management systems at each site. Unfortunately, classical load distribution policies fail on two aspects when applied to a multi-resource server grid First, simple load indices may not recognize that a resource imbalance exists at a server. Second, classical job selection policies do not actively correct such a resource-imbalanced state. We show through simulation that new policies based on resource balancing perform consistently better than the classical load distribution strategies.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122747570","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}
引用次数: 106
Fast heterogeneous binary data interchange 快速异构二进制数据交换
Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556) Pub Date : 2000-05-01 DOI: 10.1109/HCW.2000.843735
G. Eisenhauer, Lynn K. Daley
{"title":"Fast heterogeneous binary data interchange","authors":"G. Eisenhauer, Lynn K. Daley","doi":"10.1109/HCW.2000.843735","DOIUrl":"https://doi.org/10.1109/HCW.2000.843735","url":null,"abstract":"As distributed applications have become more widely used, they more often need to leverage the computing power of a heterogeneous network of computer architectures. Modern communications libraries provide mechanisms that hide at least some of the complexities of binary data interchange among heterogeneous machines. However, these mechanisms may be cumbersome, requiring that communicating applications agree a-priori on precise message contents, or they may be inefficient, using both \"up\" and \"down\" translations for binary data. Finally, the semantics of many packages, particularly those which require applications to manually \"pack\" and \"unpack\" messages, result in multiple copies of message data, thereby reducing communication performance. This paper describes PBIO (Portable Binary Input/Output), a novel messaging middleware which offers applications significantly more flexibility in message exchange while providing an efficient implementation that offers high performance.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124344766","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}
引用次数: 30
Toward quality of security service in a resource management system benefit function 实现安全服务质量在资源管理系统中的效益功能
Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556) Pub Date : 2000-05-01 DOI: 10.1109/HCW.2000.843738
C. Irvine, T. Levin
{"title":"Toward quality of security service in a resource management system benefit function","authors":"C. Irvine, T. Levin","doi":"10.1109/HCW.2000.843738","DOIUrl":"https://doi.org/10.1109/HCW.2000.843738","url":null,"abstract":"Enforcement of a high-level statement of security policy may be difficult to discern when mapped through functional requirements to a myriad of possible security services and mechanisms in a highly complex, networked environment. A method for articulating network security functional requirements, and their fulfillment, is presented. Using this method, security in a quality of service framework is discussed in terms of \"variant\" security mechanisms and dynamic security policies. For illustration, it is shown how this method can be used to represent Quality of Security Service (QoSS) in a network scheduler benefit function.","PeriodicalId":351836,"journal":{"name":"Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117007836","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}
引用次数: 40
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学术官方微信