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

The influence of the structure and sizes of jobs on the performance of co-allocation

The influence of the structure and sizes of jobs on the perf...

6th Workshop on Job Scheduling Strategies for parallel Processing, JSSPP 2000 held in conjunction with the IPDPS 2000 Conference

作者： Bucur, Anca I. D. Epema, Dick H. J. Parallel and Distributed Systems Group Delft University of Technology P.O. Box 356 Delft2600 AJ Netherlands

ISBN: (纸本)3540411208

Over the last decade, much research in the area of scheduling has concentrated on single cluster systems. Less attention has been paid to multicluster systems, although they are gaining more and more importance in practice. We propose a model for scheduling rigid jobs consisting of multiple components in multicluster systems by pure space sharing, based on the distributed ASCI Supercomputer. Using simulations, we asses the influence of the structure and sizes of the jobs on the system’s performance, measured in terms of the average response time and the maximum utilization. We consider three types of requests, total requests, unordered requests and ordered requests, and compare their effect on the system’s performance for two scheduling policies, First Come First Served, and Fit Processors First Served, which allows the scheduler to look further in the queue for jobs that fit. These types of job requests are differentiated by the restrictions they impose on the scheduler and by the form of co-allocation used. The results show that the performance improves with decreasing average job size and when fewer restrictions are imposed on the scheduler. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

The influence of communication on the performance of co-allocation

引用

7th International Workshop on Job Scheduling Strategies for parallel Processing, JSSPP 2001

作者： Bucur, A.I.D. Epema, D.H.J. Parallel and Distributed Systems Group Delft University of Technology P.O. Box 356 Delft2600 AJ Netherlands

ISBN: (纸本)3540428178

In systems consistingof multiple clusters of processors interconnected by relatively slow connections such as our distributed ASCI1 Supercomputer (DAS), jobs may request co-allocation, i.e., the simultaneous allocation of processors in different clusters. The performance of co-allocation may be severely impacted by the slowintercluster connections, and by the types of job *** distinguish different job request types ranging from ordered requests that specify the numbers of processors needed in each of the clusters, to flexible requests that only specify a total. We simulate multicluster systems with the FCFS policy— and with two policies for placinga flexible request, one tries to balance cluster loads and one tries to fill clusters completely—to determine the response times under workloads consistingof a single or of different request types for different communication speeds across the intercluster connections. In addition to a synthetic workload, we also consider a workload derived from measurements of a real application on the *** find that the communication speed difference has a severe impact on response times, that a relatively small amount of capacity is lost due to communication, and that for a mix of request types, the performance is determined not only by the separate behaviours of the different types of requests, but also by the way in which they interact. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Matching matchings

Matching matchings

引用

2013 IEEE 3rd Eastern European Regional Conference on the Engineering of Computer Based systems, ECBS-EERC 2013

作者： Bacsó, Gábor Keszler, Anita Tuza, Zsolt Laboratory of Parallel and Distributed Systems MTA SZTAKI Hungary Distributed Events Analysis Research Group MTA SZTAKI Hungary Rényi Institute Budapest Hungary University of Pannonia Veszprém Hungary

ISBN: (纸本)9780769550640

This paper presents the first steps toward a graph comparison method based on matching matchings, or in other words, comparison of independent edge sets in graphs. The novelty of our approach is to use matchings for calculating distance of graphs in case of edge-colored graphs. This idea can be used as a preprocessing step of graph querying applications, to speed up exact and inexact graph matching methods. We introduce the notion of colored matchings and prove some properties of them in edge colored complete graphs and complete bipartite graphs in case of two colors. © 2013 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Jade: A High-throughput Concurrent Copying Garbage Collector 24

Jade: A High-throughput Concurrent Copying Garbage Collector

引用

19th European Conference on Computer systems, EuroSys 2024

作者： Wu, Mingyu Mao, Liang Lin, Yude Jin, Yifeng Li, Zhe Lyu, Hongtao Tang, Jiawei Lu, Xiaowei Tang, Hao Dong, Denghui Chen, Haibo Zang, Binyu Institute of Parallel and Distributed Systems Seiee Shanghai Jiao Tong University China Alibaba Group China Engineering Research Center for Domain-specific Operating Systems Ministry of Education China

ISBN: (纸本)9798400704376

Garbage collection (GC) pauses are a notorious issue threatening the latency of applications. To mitigate this problem, state-of-the-art concurrent copying collectors allow GC threads to run simultaneously with application threads (mutators) in nearly all GC phases. However, the design of concurrent copying collectors does not always lead to low application latency. To this end, this work studies the behaviors of mainstream concurrent copying collectors in OpenJDK and mainly focuses on long application pauses under heavy workloads. By analyzing the design of those collectors, this work uncovers that lengthy pre-reclamation cycles (including GC phases before actual memory release), high GC frequency, and large metadata maintenance overhead are major factors for long pauses. Therefore, this work proposes Jade, a concurrent copying collector aiming to achieve both short pauses and high GC efficiency. Compared with existing collectors, Jade provides a group-wise collection mechanism to shorten pre-reclamation cycles while controlling GC frequency. It also embraces a generational heap layout and a single-phase algorithm to maximize young GC's throughput. The evaluation results on representative latency-critical applications show that Jade can reach sub-millisecond-level pauses even under heavy workloads and significantly improve applications' peak throughput compared with state-of-the-art concurrent collectors. © 2024 ACM.

关键词： Refuse collection

来源：评论

学校读者我要写书评

暂无评论

ndzip: A High-Throughput parallel Lossless Compressor for Scientific Data

ndzip: A High-Throughput Parallel Lossless Compressor for Sc...

引用

Data Compression Conference (DCC)

作者： Fabian Knorr Peter Thoman Thomas Fahringer Distributed and Parallel Systems Group University of Innsbruck Austria

Exchanging large amounts of floating-point data is common in distributed scientific computing applications. Data compression, when fast enough, can speed up such workloads by reducing the time spent waiting for data transfers. We propose ndzip, a high-throughput, lossless compression algorithm for multi-dimensional univariate regular grids of single- and double-precision floating point data. Tailored towards efficient implementation on modern SIMD-capable multicore processors, it compresses and decompresses data at speeds close to main memory bandwidth, significantly outperforming existing schemes. We evaluate this novel method using a representative set of scientific data, demonstrating a competitive trade-off between compression effectiveness and throughput.

关键词： Program processors Scientific computing Multicore processing Memory management Data compression distributed databases Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Presenting Scientific Legacy Programs as Grid Services via Program Synthesis

Presenting Scientific Legacy Programs as Grid Services via P...

引用

IEEE International Conference on e-Science and Grid Computing

作者： Jurgen Hofer Thomas Fahringer Distributed and Parallel Systems Group University of Innsbruck Austria

ISBN: (纸本)9781424430116

Extraordinary long lifecycles of many scientific applications commonly surpass multiple generations of Grid technologies. Therefore the smooth adaptation and migration to newer environments remains as interesting research question. This paper presents the Otho Toolkit for synthesis of application-specific Grid service wrappers based on specifications of scientific legacy programs. The services are customised and tailor-made for a specific application, service hosting environment and computational infrastructure and include source code for optional manual refinement. We demonstrate its unique combination of advanced features like support for multiple service platforms, parameter sweeping, iterative and parallel programs, progress-reporting, filestaging and security credential management. Moreover our services reliably identify program termination-causes based on programmatically evaluated post-mortem program states. We applied the Otho Toolkit recursively to itself to synthesise a sophisticated Factory service that creates application-specific Grid services on-demand^1.

关键词： Web services Resource management Mesh generation Security Production facilities Fault tolerance Performance analysis Runtime Wrapping Service oriented architecture

来源：评论

学校读者我要写书评

暂无评论

Datasets for benchmarking floating-point compressors

arXiv

引用

arXiv 2020年

作者： Knorr, Fabian Thoman, Peter Fahringer, Thomas Distributed and Parallel Systems Group University of Innsbruck Austria

Compression of floating-point data, both lossy and lossless, is a topic of increasing interest in scientific computing. Developing and evaluating suitable compression algorithms requires representative samples of data from real-world applications. We present a collection of publicly accessible sources for volume and time series data as well as a list of concrete datasets that form an adequate basis for compressor benchmarking. Copyright © 2020, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

An analysis of provisioning and allocation policies for infrastructure-as-a-service clouds 12

An analysis of provisioning and allocation policies for infr...

引用

12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, CCGrid 2012

作者： Villegas, David Antoniou, Athanasios Sadjadi, Seyed Masoud Iosup, Alexandru School of Computing and Information Sciences Florida International University Miami FL United States Parallel and Distributed Systems Group Delft University of Technology Delft Netherlands

ISBN: (纸本)9780769546919

Today, many commercial and private cloud computing providers offer resources for leasing under the infrastructure as a service (IaaS) paradigm. Although an abundance of mechanisms already facilitate the lease and use of single infrastructure resources, to complete multi-job workloads IaaS users still need to select adequate provisioning and allocation policies to instantiate resources and map computational jobs to them. While such policies have been studied in the past, no experimental investigation in the context of clouds currently exists that considers them jointly. In this paper we present a comprehensive and empirical performance-cost analysis of provisioning and allocation policies in IaaS clouds. We first introduce a taxonomy of both types of policies, based on the type of information used in the decision process, and map to this taxonomy eight provisioning and four allocation policies. Then, we analyze the performance and cost of these policies through experimentation in three clouds, including Amazon EC2. We show that policies that dynamically provision and/or allocate resources can achieve better performance and cost. Finally, we also look at the interplay between provisioning and allocation, for which we show preliminary results. © 2012 IEEE.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

Grid Resource Management 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Mumtaz Siddiqui Thomas Fahringer

来源：评论

学校读者我要写书评

暂无评论

The BTWorld use case for big data analytics: Description, MapReduce logical workflow, and empirical evaluation

The BTWorld use case for big data analytics: Description, Ma...

引用

IEEE International Conference on Big Data

作者： Tim Hegeman Bogdan Ghiţ Mihai Capotă Jan Hidders Dick Epema Alexandru Iosup Parallel and Distributed Systems Group Delft University of Technology the Netherlands

The commoditization of big data analytics, that is, the deployment, tuning, and future development of big data processing platforms such as MapReduce, relies on a thorough understanding of relevant use cases and workloads. In this work we propose BTWorld, a use case for time-based big data analytics that is representative for processing data collected periodically from a global-scale distributed system. BTWorld enables a data-driven approach to understanding the evolution of BitTorrent, a global file-sharing network that has over 100 million users and accounts for a third of today's upstream traffic. We describe for this use case the analyst questions and the structure of a multi-terabyte data set. We design a MapReduce-based logical workflow, which includes three levels of data dependency - inter-query, inter-job, and intra-job - and a query diversity that make the BTWorld use case challenging for today's big data processing tools; the workflow can be instantiated in various ways in the MapReduce stack. Last, we instantiate this complex workflow using Pig-Hadoop-HDFS and evaluate the use case empirically. Our MapReduce use case has challenging features: small (kilobytes) to large (250 MB) data sizes per observed item, excellent (10 -6 ) and very poor (10 2 ) selectivity, and short (seconds) to long (hours) job duration.

关键词： Information management Data handling Data storage systems Engines Open source software Data processing Programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：