检索结果-内蒙古大学图书馆

Simulation studies of computation and data scheduling algorithms for data grids

Journal of Grid Computing 2003年第1期1卷 53-62页

作者： Ranganathan, Kavitha Foster, Ian Department of Computer Science University of Chicago Chicago IL 60637 United States Math. and Computer Science Division Argonne National Laboratory Argonne IL 60439 United States

Data Grids seek to harness geographically distributed resources for large-scale data-intensive problems. Such problems, involving loosely coupled jobs and large data-sets, are found in fields like high-energy physics, astronomy and bioinformatics. A variety of factors need to be considered for effective scheduling of resources in such environments: e.g., resource utilization, response time, global and local allocation policies and scalability. We propose a general and extensible scheduling architecture that addresses these issues. Within this architecture we develop a suite of job scheduling and data replication algorithms that we evaluate using simulations for a wide range of parameters. Our results show that it is important to evaluate the combined effectiveness of replication and scheduling strategies, rather than study them *** specifically, we find that scheduling jobs to locations that contain the data they need and asynchronously replicating popular data-sets to remote sites, works rather well. © 2003 Kluwer Academic Publishers.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

DESIGNS FROM PAIRS OF FINITE-FIELDS .1. A CYCLIC UNITAL U(6) AND OTHER REGULAR STEINER 2-DESIGNS

引用

JOURNAL OF COMBINATORIAL THEORY SERIES A 1989年第1期52卷 51-61页

作者： BAGCHI, S BAGCHI, B Computer Science Unit Stat-Math. Division Indian Statistical Institute 203 Barrackpore Trunk Road Calcutta 700 035 India

A general construction for Steiner 2-designs with prime power block size (and with a point-regular automorphism group) is presented. Its success depends on number-theoretic restrictions on the parameters—these are completely analysed in case of block sizes k ⩽ 11. The new designs constructed include infinitely many cyclic Steiner 2-designs with block size 7. Among them is a cyclic unital U (6), that is, an S (2, 6 + 1, 6 3 + 1). It is the first example of a unital with non-prime power parameter and the second example of a cyclic unital.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The globus extensible input/output system (XIO): A protocol independent IO system for the Grid

The globus extensible input/output system (XIO): A protocol ...

引用

19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

作者： Allcock, William Bresnahan, John Kettimuthu, Rajkumar Link, Joseph Math. and Computer Science Division Argonne National Laboratory Argonne IL 60439

ISBN: (纸本)0769523129

In distributed heterogeneous Grid environments the protocols used to exchange bits are crucial. As researchers work hard to discover the best new protocol for the Grid, application developers struggle with ways to use these new protocols. A stable, consistent, and intuitive framework is needed to aid in the implementation and use of these protocols. While the application must not be burdened with the protocol details some of it may need to be exposed to take advantage of potential optimizations. In this paper we examine how the Globus XIO API provides this framework. We will explore the performance implications of using this abstraction layer and the benefits gained in application as well as protocol development.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Tuning the Interpolation Basis in a Multigrid Decomposition for Local Error Control

Tuning the Interpolation Basis in a Multigrid Decomposition ...

引用

2024 IEEE International Conference on Big Data, BigData 2024

作者： Vidal, Nicolas Gong, Qian Reshniak, Viktor Archibald, Rick Klasky, Scott Oak Ridge National Laboratory Computer Science and Math. Division Oak RidgeTN United States

ISBN: (纸本)9798350362480

In the compression of scientific data, error-controlled compressors enable to considerably decrease the size of the dataset while maintaining adequate levels of accuracy. In this paper, we note that multi-level refactoring scheme such as MGARD i) rely on an approximation of the data based on the interpolation of coefficients, ii) estimate the resulting error with global metrics on the dataset. To improve on these two aspects, we propose a method that aims to divide the original dataset into blocks based on their smoothness and refactors each block separately with the most relevant interpolation order. We show the relevance of such a method on tailored datasets and the benefits and challenges when applying it to large scientific data. © 2024 IEEE.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

A Framework for Compressing Unstructured Scientific Data via Serialization

A Framework for Compressing Unstructured Scientific Data via...

引用

2024 IEEE International Conference on Big Data, BigData 2024

作者： Reshniak, Viktor Gong, Qian Archibald, Rick Klasky, Scott Podhorszki, Norbert Oak Ridge National Laboratory Computer Science and Math. Division Oak RidgeTN United States

ISBN: (纸本)9798350362480

We present a general framework for compressing unstructured scientific data with known local connectivity. A common application is simulation data defined on arbitrary finite element meshes. The framework employs a greedy topology preserving reordering of original nodes which allows for seamless integration into existing data processing pipelines. This reordering process depends solely on mesh connectivity and can be performed offline for optimal efficiency. However, the algorithm's greedy nature also supports on-the-fly implementation. The proposed method is compatible with any compression algorithm that leverages spatial correlations within the data. The effectiveness of this approach is demonstrated on a large-scale real dataset using several compression methods, including MGARD, SZ, and ZFP. © 2024 IEEE.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Parallel components for PDEs and optimization: Some issues and experiences

Parallel components for PDEs and optimization: Some issues a...

引用

作者： Norris, Boyana Balay, Satish Benson, Steven Freitag, Lori Hovland, Paul McInnes, Lois Smith, Barry Math. and Computer Science Division Argonne National Laboratory 9700 S. Cass Avenue Argonne IL 60439 United States

High-performance simulations in computational science often involve the combined software contributions of multidisciplinary teams of scientists, engineers, math.maticians, and computer scientists. One goal of component-based software engineering in large-scale scientific simulations is to help manage such complexity by enabling better interoperability among codes developed by different groups. This paper discusses recent work on building component interfaces and implementations in parallel numerical toolkits for mesh manipulations, discretization, linear algebra, and optimization. We consider several motivating applications involving partial differential equations and unconstrained minimization to demonstrate this approach and evaluate performance. © 2002 Elsevier science B.V. All rights reserved.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Portable, MPI-interoperable Coarray Fortran 14

Portable, MPI-interoperable Coarray Fortran

引用

2014 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2014

作者： Yang, Chaoran Bland, Wesley Mellor-Crummey, John Balaji, Pavan Department of Computer Science Rice University United States Math. and Comp. Sci. Division Argonne National Laboratory United States Mathematics and Computer Science Division Argonne National Laboratory United States

ISBN: (纸本)9781450326568

The past decade has seen the advent of a number of parallel programming models such as Coarray Fortran (CAF), Unified Parallel C, X10, and Chapel. Despite the productivity gains promised by these models, most parallel scientific applications still rely on MPI as their data movement model. One reason for this trend is that it is hard for users to incrementally adopt these new programming models in existing MPI applications. Because each model use its own runtime system, they duplicate resources and are potentially errorprone. Such independent runtime systems were deemed necessary because MPI was considered insufficient in the past to play this role for these languages. The recently released MPI-3, however, adds several new capabilities that now provide all of the functionality needed to act as a runtime, including a much more comprehensive one-sided communication framework. In this paper, we investigate how MPI-3 can form a runtime system for one example programming model, CAF, with a broader goal of enabling a single application to use both MPI and CAF with the highest level of interoperability. Copyright © 2014 ACM.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

Portable, MPI-interoperable coarray fortran

Portable, MPI-interoperable coarray fortran

引用

The past decade has seen the advent of a number of parallel programming models such as Coarray Fortran (CAF), Unified Parallel C, X10, and Chapel. Despite the productivity gains promised by these models, most parallel scientific applications still rely on MPI as their data movement model. One reason for this trend is that it is hard for users to incrementally adopt these new programming models in existing MPI applications. Because each model use its own runtime system, they duplicate resources and are potentially error-prone. Such independent runtime systems were deemed necessary because MPI was considered insufficient in the past to play this role for these languages. The recently released MPI-3, however, adds several new capabilities that now provide all of the functionality needed to act as a runtime, including a much more comprehensive one-sided communication framework. In this paper, we investigate how MPI-3 can form a runtime system for one example programming model, CAF, with a broader goal of enabling a single application to use both MPI and CAF with the highest level of interoperability. © 2014 ACM.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

Full abstractness of a metric semantics for action refinement

引用

Fundamenta Informaticae 1999年第4期40卷 335-382页

作者： Den, Hartog, J.I. De, Vink, E.P. De, Bakker, J.W. Math. and Computer Science Division Vrije Universiteit Amsterdam Netherlands KPN Research Leidschendam Netherlands Department of Software Engineering CWI Amsterdam Netherlands KPN Research P.O. Box 421 2260 AK Leidschendam Netherlands

For a process language with action refinement and synchronization both an operational and a denotational semantics are given. The operational semantics is based on an SOS-style transition system specification involving syntactical refinement sequences. The denotational semantics is an interleaving model which uses semantical refinement 'environments'. It identifies those statements which are equal under all refinements. The denotational model is shown to be fully abstract with respect to the operational one. The underlying metric machinery is exploited to obtain this full abstractness result. Usually, action refinement is treated either in a model with some form of true concurrency, or, when an interleaving model is applied, by assuming that the refining statements are atomized. We argue that an interleaving model without such atomization is attractive as well.

关键词： operational semantics denotational semantics metric topology action refinement full abstractness semantical refinement

来源：评论

学校读者我要写书评

暂无评论

Virtual sensor networks - A resource efficient approach for concurrent applications

Virtual sensor networks - A resource efficient approach for ...

引用

4th International Conference on Information Technology-New Generations, ITNG 2007

作者： Jayasumana, Anura P. Qi, Han Illangasekare, Tissa H. Dept. of Electrical and Computer Engineering Colorado State University Dept. of Math. and Computer Sciences Colorado School of Mines Division of Environmental Science and Engineering Colorado School of Mines

ISBN: (纸本)0769527760

Current focus of sensor networks is on systems dedicated for a specific application. Wide variety of circumstances point to the need for sensor network deployments capable of sharing the physical network resources. We introduce the concept of Virtual Sensor Networks (VSN) to provide protocol support for the formation, usage, adaptation and maintenance of subsets of sensors collaborating on specific tasks. VSN concept also promises to enhance applications that involve dynamically varying subsets of sensor nodes collaborating tightly to achieve the desired outcomes, while relying on the remaining nodes to achieve connectivity and overcome the deployment and resource constraints. This article explores the concept, mechanisms, and benefits of using VSN. Examples of VSN support functionality include support for nodes to join and leave VSNs, broadcast within a VSN, and merging of VSNs. VSNs will simplify application deployment, enhance performance and scalability, facilitate resource sharing, and provide a degree of physical topology independence in wireless sensor networks. Deployment of overlapping sensor networks aimed at different tasks, especially in harsh environments, will also significantly benefit when organized as VSNs over a shared infrastructure © 2007 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：