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

骈文研究最新文献

筛选
英文 中文
Parallelization of the GNU Scientific Library on heterogeneous systems GNU科学库在异构系统上的并行化
骈文研究 Pub Date : 2004-07-05 DOI: 10.1109/ISPDC.2004.39
J. Aliaga, F. Almeida, J. M. Badía, S. Barrachina, Vicente Blanco Pérez, María Isabel Castillo, U. Dorta, R. Mayo, E. S. Quintana‐Ortí, G. Quintana-Ortí, C. Rodríguez, F. D. Sande
{"title":"Parallelization of the GNU Scientific Library on heterogeneous systems","authors":"J. Aliaga, F. Almeida, J. M. Badía, S. Barrachina, Vicente Blanco Pérez, María Isabel Castillo, U. Dorta, R. Mayo, E. S. Quintana‐Ortí, G. Quintana-Ortí, C. Rodríguez, F. D. Sande","doi":"10.1109/ISPDC.2004.39","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.39","url":null,"abstract":"In this paper we present our joint efforts towards the development of a parallel version of the GNU Scientific Library for heterogeneous systems. Two well-known operations arising in discrete mathematics and sparse linear algebra allow us to describe the design and the implementation of the library, and to report experimental results on heterogeneous clusters of personal computers.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82848770","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}
引用次数: 7
Distributed shared memory system based on the Maestro2 high performance cluster network 基于maestro高性能集群网络的分布式共享内存系统
骈文研究 Pub Date : 2004-07-05 DOI: 10.1109/ISPDC.2004.19
K. Ferreira, S. Yamagiwa, L. Sousa, K. Aoki, K. Wada, L. M. Campos
{"title":"Distributed shared memory system based on the Maestro2 high performance cluster network","authors":"K. Ferreira, S. Yamagiwa, L. Sousa, K. Aoki, K. Wada, L. M. Campos","doi":"10.1109/ISPDC.2004.19","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.19","url":null,"abstract":"Cluster computing has become a valid alternative for high performance computing. To fully exploit the computing power of these environments, one must utilize high performance network and protocol technologies, since parallel applications running on clusters require low latency and high throughput. To address this issue, Maestro2 high performance network technology has been developed. Parallel applications running on clusters usually use two different known alternatives to share information; message passing or distributed shared memory. Maestro2 already supports a high performance message passing communication system, MMP. This paper describes a first version of a distributed shared memory system based on Maestro2, and a first set of experimental results is presented.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83800023","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
Scalability analysis of matrix-matrix multiplication on heterogeneous clusters 异构集群上矩阵-矩阵乘法的可扩展性分析
骈文研究 Pub Date : 2004-07-05 DOI: 10.1109/ISPDC.2004.45
A. Kalinov
{"title":"Scalability analysis of matrix-matrix multiplication on heterogeneous clusters","authors":"A. Kalinov","doi":"10.1109/ISPDC.2004.45","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.45","url":null,"abstract":"The paper is devoted to scalability analysis of a typical linear algebra algorithm on heterogeneous clusters. We proof that traditional scalability metrics proposed for analysis of linear algebra algorithms is applicable on heterogeneous platform and investigate influence of three heterogeneous strategies of computation distribution to scalable universal matrix multiplication algorithm (SUMMA) scalability.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87375449","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}
引用次数: 17
Task scheduling: considering the processor involvement in communication 任务调度:考虑处理器参与通信
骈文研究 Pub Date : 2004-07-05 DOI: 10.1109/ISPDC.2004.48
O. Sinnen, L. Sousa
{"title":"Task scheduling: considering the processor involvement in communication","authors":"O. Sinnen, L. Sousa","doi":"10.1109/ISPDC.2004.48","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.48","url":null,"abstract":"Classical task scheduling employs a very simplified model of the target parallel system. Experiments demonstrated that this leads to inaccurate and inefficient schedules. Contention aware scheduling heuristics take the contention for communication resources into account, which improves the schedules significantly. Yet, one aspect remains to be investigated: the involvement of the processors in communication. This paper proposes a new scheduling model, called involvement-contention model, that integrates the consideration for the processor involvement into task scheduling. A list scheduling based heuristic is proposed for the new model, which produces significantly more accurate and efficient schedules in experiments on real parallel systems.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73222098","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
Bridging Secure WebCom and European DataGrid security for multiple VOs over multiple grids 桥接安全的WebCom和欧洲数据网格安全的多个VOs在多个网格
骈文研究 Pub Date : 2004-07-05 DOI: 10.1109/ISPDC.2004.14
D. O'Callaghan, B. Coghlan
{"title":"Bridging Secure WebCom and European DataGrid security for multiple VOs over multiple grids","authors":"D. O'Callaghan, B. Coghlan","doi":"10.1109/ISPDC.2004.14","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.14","url":null,"abstract":"Secure job submission across multiple virtual organisations becomes more important as Grids proliferate. WebCom-G will bring together the condensed graph model of computing and existing Grid software from the European DataGrid (EDG) project to allow users to execute complex tasks involving multiple Grids. In this paper we discuss the security aspects of a system to allow users of existing Grids to securely execute condensed graphs containing Grid jobs. We outline the process that bridges the EDG security architecture and Secure WebCom to make this possible.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73388371","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}
引用次数: 7
Assessing the impact and limits of steady-state scheduling for mixed task and data parallelism on heterogeneous platforms 评估稳态调度对异构平台上混合任务和数据并行性的影响和限制
骈文研究 Pub Date : 2004-07-05 DOI: 10.1109/ISPDC.2004.12
Olivier Beaumont, Arnaud Legrand, L. Marchal, Y. Robert
{"title":"Assessing the impact and limits of steady-state scheduling for mixed task and data parallelism on heterogeneous platforms","authors":"Olivier Beaumont, Arnaud Legrand, L. Marchal, Y. Robert","doi":"10.1109/ISPDC.2004.12","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.12","url":null,"abstract":"In this paper, we consider steady-state scheduling techniques for mapping a collection of task graphs onto heterogeneous systems, such as clusters and grids. We advocate the use of steady-state scheduling to solve this difficult problem. Due to space limitations, we concentrate on complexity results. We show that the problem of optimizing the steady-state throughput is NP-complete in the general case. We formulate a compact version of the problem that belongs to the NP complexity class but which does not restrict the optimality of the solution. We provide many positive results in the extended version (Beaumont et al., 2004). Indeed, we show how to determine in polynomial time the best steady-state scheduling strategy for a large class of application graphs and for an arbitrary platform graphs, using a linear programming approach.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74923140","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}
引用次数: 37
Voronoi mobile cellular networks: topological properties Voronoi移动蜂窝网络:拓扑特性
骈文研究 Pub Date : 2004-07-05 DOI: 10.1109/ISPDC.2004.58
Anne-Elisabeth Baert, D. Semé
{"title":"Voronoi mobile cellular networks: topological properties","authors":"Anne-Elisabeth Baert, D. Semé","doi":"10.1109/ISPDC.2004.58","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.58","url":null,"abstract":"Nowadays, mobile cellular networks are based on the well-known hexagonal mesh in which nodes are considered as base stations. However, this model does not really take into account the irregularity and the randomness of central offices locations in a large telephone network. As we cannot transform this telephone network into a regular structure, because of spatial variations of population density, consumer demand, other geographical and technological factors, Voronoi cellular networks appears to be the more suitable model. In this paper, we describe the Voronoi cellular model and its topological properties.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82346261","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}
引用次数: 34
AGORA: an architecture for strategyproof computing in grids AGORA:网格中防策略计算的架构
骈文研究 Pub Date : 2004-07-05 DOI: 10.1109/ISPDC.2004.9
Daniel Grosu
{"title":"AGORA: an architecture for strategyproof computing in grids","authors":"Daniel Grosu","doi":"10.1109/ISPDC.2004.9","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.9","url":null,"abstract":"Grids enable the sharing of resources and problem solving in multi-organizational environments. The problem of resource management in such systems is very complex because the participants, resource owners and users, have their own requirements and objectives that need to be considered when making allocation decisions. To address this issue novel protocols that take into account the self-interest and incentives of these participants need to be developed. These kinds of protocols in which the participants maximize their own utilities only if they report their true parameters and follow the rules are called strategyproof protocols. In this paper we propose AGORA, an architecture for strategyproof computing in grids and present several strategyproof mechanisms for resource allocation that can be deployed on this architecture.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90432759","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
Parallel approximate finite element inverse preconditioning on distributed systems 分布式系统的并行近似有限元逆预处理
骈文研究 Pub Date : 2004-07-05 DOI: 10.1109/ISPDC.2004.36
G. Gravvanis, K. M. Giannoutakis
{"title":"Parallel approximate finite element inverse preconditioning on distributed systems","authors":"G. Gravvanis, K. M. Giannoutakis","doi":"10.1109/ISPDC.2004.36","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.36","url":null,"abstract":"New parallel Normalized Explicit Preconditioned Conjugate Gradient-type methods are introduced for solving finite element systems on distributed memory MIMD systems. The performance and applicability of the proposed methods implemented in message passing interface, is discussed by solving a characteristic two dimensional boundary value problem and numerical results are given.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85063554","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
A new model for 3D cellular mobile networks 三维蜂窝移动网络的新模型
骈文研究 Pub Date : 2004-07-05 DOI: 10.1109/ISPDC.2004.4
C. Decayeux, D. Semé
{"title":"A new model for 3D cellular mobile networks","authors":"C. Decayeux, D. Semé","doi":"10.1109/ISPDC.2004.4","DOIUrl":"https://doi.org/10.1109/ISPDC.2004.4","url":null,"abstract":"In this work, we propose to extend the standard concept of planar cellular networks into space. Indeed, in cellular networks the trend is to have smaller cells for indoor environment. Then, we give a description of a 3D picocellular network based on layers of hexagonal mesh to ensure that challenge.","PeriodicalId":62714,"journal":{"name":"骈文研究","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88499751","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}
引用次数: 16
首页 上一页 下一页 尾页
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学术官方微信