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

A Data-Aware Scheduling Strategy for Executing Large-Scale distributed Workflows

IEEE ACCESS 2021年 9卷 47354-47364页

作者： Giampa, Salvatore Belcastro, Loris Marozzo, Fabrizio Talia, Domenico Trunfio, Paolo Univ Calabria DIMES I-87036 Arcavacata Di Rende Italy Univ Calabria DtoK Lab Srl I-87036 Arcavacata Di Rende Italy

Task scheduling is a crucial key component for the efficient execution of data-intensive applications on distributed environments, by which many machines must be coordinated to reduce execution times and bandwidth consumption. This paper presents ADAGE, a data-aware scheduler designed to efficiently execute data-intensive workflows in large-scale computers. The proposed scheduler is based on three key features: i) critical path analysis, for discovering the critical tasks of a workflow and reducing data transferring between nodes;ii) work giving, a new dynamic planning strategy for migrating tasks from overloaded to unloaded nodes;and iii) task replication, which executes task replicas on different nodes for improving both execution time and fault tolerance. Experiments performed on a distributed computing environment composed of up to 1,024 processing nodes show that ADAGE achieves better performances than existing scheduling systems, obtaining an average reduction of up to 66% in execution time.

关键词： Data-aware scheduler workflow scheduling distributed workflows parallel programming distributed computing exascale computing

来源：评论

学校读者我要写书评

暂无评论

Security-driven distributed platforms for intellectual property resource provision-a case study of TSITE IP

引用

JOURNAL OF CLOUD computing-ADVANCES SYSTEMS AND APPLICATIONS 2021年第1期10卷 1-15页

作者： Wang, Yang Nanjing Univ Sci & Technol Sch Intellectual Property Nanjing Peoples R China

In the information age, with the vigorous development of big data and artificial intelligence, intellectual property protection is an essential part of the current scientific and technological development. Intellectual property related data grows in a geometric progression, so the demand for IP data storage space is also increasing day by day. With the rise of cloud computing technology, intellectual property data distributed platforms based on cloud storage have also been produced one after another. Because the biggest feature of cloud storage is that storage is a service, it puts forward higher requirements for the intellectual property service industry. Firstly, it introduces the domestic intellectual property cloud platform services from the perspectives of government support, state-owned enterprises and private enterprises;Secondly, four typical distributed platforms provided by commercial resources are selected to introduce their operation modes, focusing on the problems faced by domestic intellectual property service modes;Secondly, it compares and discusses the current situation of domestic intellectual property distributed platforms;Then, aiming at the current domestic intellectual property service mode, taking tsite as an example, this paper puts forward the design and construction strategy of intellectual property protection, intellectual property operation service distributed platform and operation service mode under the background of information age.

关键词： Intellectual property Cyber security Privacy protection Operation service distributed computing TSITE

来源：评论

学校读者我要写书评

暂无评论

DeeperThings: Fully distributed CNN Inference on Resource-Constrained Edge Devices

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2021年第4期49卷 600-624页

作者： Stahl, Rafael Hoffman, Alexander Mueller-Gritschneder, Daniel Gerstlauer, Andreas Schlichtmann, Ulf Tech Univ Munich Munich Germany Univ Texas Austin Austin TX 78712 USA

Performing inference of Convolutional Neural Networks (CNNs) on Internet of Things (IoT) edge devices ensures both privacy of input data and possible run time reductions when compared to a cloud solution. As most edge devices are memory- and compute-constrained, they cannot store and execute complex CNNs. Partitioning and distributing layer information across multiple edge devices to reduce the amount of computation and data on each device presents a solution to this problem. In this article, we propose DeeperThings, an approach that supports a full distribution of CNN inference tasks by partitioning fully-connected as well as both feature- and weight-intensive convolutional layers. Additionally, we jointly optimize memory, computation and communication demands. This is achieved using techniques to combine both feature and weight partitioning with a communication-aware layer fusion method, enabling holistic optimization across layers. For a given number of edge devices, the schemes are applied jointly using Integer Linear Programming (ILP) formulations to minimize data exchanged between devices, to optimize run times and to find the entire model's minimal memory footprint. Experimental results from a real-world hardware setup running four different CNN models confirm that the scheme is able to evenly balance the memory footprint between devices. For six devices on 100 Mbit/s connections the integration of layer fusion additionally leads to a reduction of communication demands by up to 28.8%. This results in run time speed-up of the inference task by up to 1.52x compared to layer partitioning without fusing.

关键词： Deep learning distributed computing IoT

来源：评论

学校读者我要写书评

暂无评论

An efficient distributed approach for a self-healing smart grid using minimal spanning tree

引用

INTERNATIONAL JOURNAL OF ENERGY RESEARCH 2021年第10期45卷 15049-15084页

作者： Nedjah, Nadia Cardoso, Kleber Hochwart Mourelle, Luiza Macedo Univ Estado Rio De Janeiro Dept Elect Engn & Telecommun Rio De Janeiro Brazil Univ Estado Rio De Janeiro Dept Syst Engn & Computat Rio De Janeiro Brazil Rua Sao Francisco Xavier 524 Sala 5145-F BR-20550013 Rio De Janeiro Maracana Brazil

In the event of a network failure that compromises energy supply, the characteristic of smart grid self-healing consists of finding a proposal for reconfiguration of the grid, aiming at restoring the power, partially or completely to supply all network nodes. The search for a satisfactory reconfiguration is a combinatorial problem whose complexity is proportional to the network size. An exhaustive search-based method is time-consuming and often computationally non-viable. To overcome this difficulty, techniques for generating minimal spanning trees (MSTs) of the graph that represents the smart grid, are exploited. However, existing studies provide centralized implementations. In this work, we propose a distributed implementation, where each of the network switch collaborates in developing of the recovery solution. The proposed decentralized approach seeks a reduction of reconfiguration time requirements, thus increasing network intelligence. For this purpose, a distributed algorithm for building the MST is embedded in the processing elements available at the commutation nodes. The evaluated case studies show that, whenever possible, the proposed solution allows for a successful reconfiguration, regardless of the number of simultaneous failures. Moreover, the network reconfiguration time is not significantly impacted by the number of buses and included lines. The implementation presents results of communication cost and reconfiguration time significantly lower than the expected upper bounds. Notably, for the case studies, the proposed implementation achieves 70% and 69% speedup regarding the reconfiguration time from simple and multiple failures, respectively, when compared to the expected theoretical performance. Furthermore, when compared to existing multiagent-based self-healing systems, the proposed implementation recovers from failures twice as fast, making it more desirable in a smart-grid real implementation.

关键词： distributed computing minimum spanning tree self‐ healing smart grids

来源：评论

学校读者我要写书评

暂无评论

An Incremental Iterative Acceleration Architecture in distributed Heterogeneous Environments With GPUs for Deep Learning

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2021年第11期32卷 2823-2837页

作者： Zhang, Xuedong Tang, Zhuo Du, Lifan Yang, Li Hunan Univ Coll Comp Sci & Elect Engn Natl Supercomp Ctr Changsha Changsha 410082 Peoples R China Natl Univ Def Technol Sci & Technol Parallel & Distributed Proc Lab Changsha 410073 Peoples R China Changsha Univ Sci & Technol Coll Comp & Commun Engn Changsha 410076 Hunan Peoples R China

The parallel computing capabilities of GPUs have a significant impact on computationally intensive iterative tasks. Offloading part or all of the deep learning tasks from the CPU to the GPU for execution is mainstream. However, a large number of redundant iterative calculations exist in the iterative process of computing tasks. Therefore, we propose a GPU-based distributed incremental iterative computing architecture that can make full use of distributed parallel computing and GPU memory structure. The architecture supports deep learning and other computationally intensive iterative applications by optimizing data placement and reducing redundant iterative calculations. To support block-based data partitioning and coalesced memory access on GPUs, we propose GDataSet, an abstract data set. The GPU incremental iteration manager called GTracker is designed to be responsible for GDataSet cache management on the GPU. In order to solve the limitation of on-chip memory size, we propose a variable sliding window mechanism. It improves the hit rate of cache access and the speed of data access by realizing the best block arrangement between on-chip memory and off-chip memory. Besides, a communication channel based on an incremental iterative model is designed to support data transmission and task communication in cluster computing. Finally, we implement the proposed architecture based on Spark 2.4.1 and CUDA 10.0. Comparative experiments with widely used computationally intensive iterative applications (K-means, LSTM, etc.) show that the incremental iterative acceleration architecture can significantly improve the efficiency of iterative computing.

关键词： Graphics processing units Computational modeling Deep learning Training Task analysis Sparks Parallel processing Deep learning distributed computing incremental iteration GPU

来源：评论

学校读者我要写书评

暂无评论

Codes Trading Upload for Download Cost in Secure distributed Matrix Multiplication

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2021年第8期69卷 5409-5424页

作者： Kakar, Jaber Khristoforov, Anton Ebadifar, Seyedhamed Sezgin, Aydin Ruhr Univ Bochum Inst Digital Commun Syst D-44801 Bochum Germany

In secure distributed matrix multiplication (SDMM) the multiplication AB from two private matrices A and B is outsourced to N distributed servers. In l-SDMM, the goal is to design a joint communication-computation procedure that optimally balances conflicting communication and computation metrics without leaking any information on both A and B to any set of l(i) and (B) over tilde (i) representing encoded versions of A and B destined to the i-th server. Now, SDMM involves multiple tradeoffs. One such tradeoff is the tradeoff between upload (UL) and download (DL) costs. To find a good balance between these two metrics, we propose two schemes which we term USCSA and GSCSA that are based on secure cross subspace alignment (SCSA). We show that there are various scenarios where they outperform existing SDMM schemes from the literature with respect to UL-DL efficiency. Next, we implement schemes from the literature, including USCSA and GSCSA, and test their performance on Amazon EC2. Our numerical results show that USCSA and GSCSA establish a good balance between the time spent on the communication and computation in SDMMs. This is because they combine advantages of polynomial codes, namely low time for the upload of (A) over tilde (i) and (B) over tilde (i), i is an element of [1 : N], and the computation of O-i = (A) over tilde (i) (B) over tilde (i), with those of SCSA, being a low timing overhead for the download of O-i, i is an element of [1 : N], and the decoding of AB.

关键词： Matrix multiplication security interference alignment distributed computing

来源：评论

学校读者我要写书评

暂无评论

Cross Subspace Alignment Codes for Coded distributed Batch Computation

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2021年第5期67卷 2821-2846页

作者： Jia, Zhuqing Jafar, Syed Ali Univ Calif Irvine Ctr Pervas Commun & Comp Dept Elect Engn & Comp Sci Irvine CA 92697 USA

The goal of coded distributed computation is to efficiently distribute a computation task, such as matrix multiplication, N-linear computation, or multivariate polynomial evaluation, across S servers through a coding scheme, such that the response from any R servers (R is called the recovery threshold) is sufficient for the user to recover the desired computed value. Current state-of-art approaches are based on either exclusively matrix-partitioning (Entangled Polynomial (EP) Codes for matrix multiplication), or exclusively batch processing (Lagrange Coded computing (LCC) for N-linear computations or multivariate polynomial evaluations). We present three related classes of codes, based on the idea of Cross-Subspace Alignment (CSA) which was introduced originally in the context of secure and private information retrieval. CSA codes are characterized by a Cauchy-Vandermonde matrix structure that facilitates interference alignment along Vandermonde terms, while the desired computations remain resolvable along the Cauchy terms. These codes are shown to unify, generalize and improve upon the state-of-art codes for distributed computing. First we introduce CSA codes for matrix multiplication, which yield LCC codes as a special case, and are shown to outperform LCC codes in general in download-limited settings. While matrix-partitioning approaches (EP codes) for distributed matrix multiplication have the advantage of flexible server computation latency, batch processing approaches (CSA, LCC) have significant advantages in communication costs as well as encoding and decoding complexity per matrix multiplication. In order to combine the benefits of these approaches, we introduce Generalized CSA (GCSA) codes for matrix multiplication that bridge the extremes of matrix-partitioning and batch processing approaches and demonstrate synergistic gains due to cross subspace alignment. Finally, we introduce N-CSA codes for N-linear distributed batch computations and multivariate batc

关键词： Coding distributed computing parallelization security

来源：评论

学校读者我要写书评

暂无评论

Scheduling Big Machine Learning Tasks on Clusters of Heterogeneous Edge Devices 17

Scheduling Big Machine Learning Tasks on Clusters of Heterog...

引用

17th International Conference on COMmunication Systems and NETworkS, COMSNETS 2025

作者： Mathkar, Saumya Aiyer, Shreya Bapat, Yashovardhan Pinki, Pinki Paul, Arnab K. Naik, Vinayak BITS Pilani Department of CSIS Goa India

ISBN: (纸本)9798331531195

Edge computing has transformed machine learning by using computing closer to the data sources, thereby reducing latency. The ever-increasing volume of data has necessitated forming clusters of edge devices, possibly with heterogeneous capabilities. Managing heterogeneous resources such as computation and memory remains challenging. Given the capabilities of the edge devices, we need a simple technique suitable for an Edge computing *** introduce a scheduling mechanism that leverages Integer Linear Programming (ILP) to optimize the overall computation time of ML-based tasks. We implement our scheduling mechanism that efficiently allocates resources, ensuring tasks are executed parallel across the cores of edge devices in a cluster by minimizing computation time. For tasks large enough to fit on any core, we leverage distributed learning to train the model in pieces and later combine them. We employ our ILP-based scheduler for efficient task allocation and compare its performance with a Greedy, simple approach based on best-fit technique. We evaluate our approach on three cases of sets of tasks on the spectrum of uniformity and size. Our results demonstrate two times the speed gain for our ILP-based approach over Greedy for the category with the least uniformity and large size. © 2025 IEEE.

关键词： distributed computing Edge computing Optimization

来源：评论

学校读者我要写书评

暂无评论

distributed MONITORING FOR ENERGY INFRASTRUCTURES: A TWO-TIER ANALYSIS OVER WIRELESS NETWORKS

引用

IEEE WIRELESS COMMUNICATIONS 2021年第6期28卷 13-18页

作者： Zhang, Chi Zhen, Liangli Zhou, Joey Chen, Cen ASTAR Inst High Performance Comp Singapore Singapore ASTAR Inst Infocomm Res Singapore Singapore

Wireless networks (e.g., 5G networks) enable distributed energy infrastructures to be connected even when they are geometrically isolated. Intelligent monitoring from remote sites therefore becomes possible, allowing decision makers to examine the status of distributed energy infrastructures from a central location. The major challenge is when local devices cannot perform the monitoring independently;transmitting every signal back to the central server triggers enormous amounts of wireless communication. To address this, we propose a two-tier AI system by offloading computations to multiple devices. Specifically, we build lightweight AI models for deployment on edge clients (i.e., edge sensors) and a large-scale AI model for the central server. These two types of AI models are trained with different criteria: the models on the edges act as the filtering tools to detect abnormal events and maximally avoid making false negative predictions, whereas the server model is supposed to be an expert for accurate predictions. By validating on a power theft dataset, we show that such a cascading methodology could filter out sufficient negative examples on the edge side while still being able to provide precise predictions on the second-round analysis.

关键词： Performance evaluation distributed computing Image edge detection Computational modeling Wireless networks Predictive models Sensors 5G mobile communication

来源：评论

学校读者我要写书评

暂无评论

SEECSSim: A toolkit for parallel and distributed simulations for mobile devices

引用

JOURNAL OF SIMULATION 2021年第3期15卷 235-260页

作者： Maqbool, Fahad Malik, Asad Waqar Naqvi, Syed Meesam Raza Ahmed, Nadeem D'Angelo, Gabriele Mahmood, Imran Natl Univ Sci & Technol Sch Elect Engn & Comp Sci Islamabad Pakistan Univ Malaya Fac Comp Sci & Informat Technol Dept Informat Syst Kuala Lumpur Malaysia Univ Bologna Dept Comp Sci & Engn DISI Bologna Italy

Increase of the computing power on handheld devices has made these devices attractive for many applications including simulation systems. There are Parallel Discrete-Event Simulation (PDES) frameworks exists but most of these are designed for cluster systems, not suitable for battery operated devices. In this paper, the well- known Rensselaer's Optimistic Simulation System (ROSS) framework has been instrumented for a detailed analysis in terms of CPU usage, memory consumption, energy and power requirements. This profiling helps in selecting the appropriate synchronisation algorithm for running the PDES frameworks on the mobile devices. Further, we propose a simulation framework (referred as SEECSSim1) that is specifically designed for handheld devices. It is the first one designed keeping in mind the characteristics and the constraints of mobile devices. SEECSSim includes the support for a number of state-of-the-art synchronisation protocols. The performance of SEECSSim has been studied using a PHOLD simulation model for different synchronisation algorithms.

关键词： distributed computing mobile computing performance analysis simulations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：