Adaptively Periodic I/O Scheduling for Concurrent HPC Applications
نویسندگان
چکیده
With the convergence of big data and HPC (high-performance computing), various machine learning applications traditional large-scale simulations with a stochastically iterative I/O periodicity are running concurrently on platforms, which poses more challenges scarcely shared resources due to ever-growing transfer demand. Currently existing heuristic online periodic offline scheduling methods for fixed not suitable periodicities, required schedule concurrent I/Os from different under congestion. In this work, we propose an adaptively (APIO) method that optimizes system efficiency application dilation by taking into account. We first build within specified duration capture nature. After that, APIO adjusts bandwidth allocation resist stochasticity based actual length computing phrase. case where does satisfy requirements, period will be extended adapt duration. Theoretical analysis extensive demonstrate our proposed over approach.
منابع مشابه
Scheduling Concurrent Workflows in HPC Cloud through Exploiting Schedule Gaps
Many large-scale scientific applications are usually constructed as workflows due to large amounts of interrelated computation and communication. Workflow scheduling has long been a research topic in parallel and distributed computing. However, most previous research focuses on single workflow scheduling. As cloud computing emerges, users can now have easy access to on-demand high performance c...
متن کاملDetailed Characterization of HPC Applications for Co-Scheduling
In recent years the cost for power consumption in HPC systems has become a relevant factor. One approach to improve energy efficiency without changing applications is coscheduling, that is, more than one job is executed simultaneously on the same nodes of a system. If co-scheduled applications use different resource types, improved efficiency can be expected. However, applications may also slow...
متن کاملMobile Elements Scheduling for Periodic Sensor Applications
In this paper, we investigate the problem of designing the mobile elements tours such that the length of each tour is below a per-determined length and the depth of the multi-hop routing trees bounded by k. The path of the mobile element is designed to visit subset of the nodes (cache points). These cache points store other nodes data. To address this problem, we propose two heuristic-based sol...
متن کاملScheduling Adaptively Parallel Jobs Scheduling Adaptively Parallel Jobs
An adaptively parallel job is one in which the number of processors which can be used without waste changes during execution. When allocating processors to multiple adap-tively parallel jobs, a job scheduler should attempt to be fair|meaning that no job gets fewer processors than another, unless it demands fewer|and eecient|meaning that the scheduler does not waste processors on jobs that do no...
متن کاملUtility functions for adaptively executing concurrent workflows
Workflows are widely used in applications that require coordinated use of computational resources. Workflow definition languages typically abstract over some aspects of the way in which a workflow is to be executed, such as the level of parallelism to be used or the physical resources to be deployed. As a result, a workflow management system has responsibility for establishing how best to map t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2022
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics11091318