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

Moderated Resource Elasticity for Stream Processing Applications 1

23rd international conference on Parallel and distributed computing (Euro-Par)

作者： Borkowski, Michael Hochreiner, Christoph Schulte, Stefan TU Wien Distributed Syst Grp Vienna Austria

ISBN: (数字)9783319751788

ISBN: (纸本)9783319751788;9783319751771

In stream processing, elasticity is often realized by adapting the system scale and topology according to the volume of input data. However, this volume is often fluctuating, with a high degree of noise, which can trigger a high amount of scaling operations. Since these scaling operations introduce additional overhead and cost, systems employing such approaches are at risk of spending a significant amount of time scaling up and down, nullifying the positive effects of scalability. To overcome this, we propose an approach for moderating the scaling behavior of stream processing applications by reducing the number of scaling operations, while still providing quick responses to changes in input data volume. Contrary to existing approaches, instead of using linear smoothing techniques, we show how to employ non-linear filtering techniques from the field of signal processing to pre-process the raw volume measurements, mitigating superfluous scaling operations, and effectively reducing the number of such operations by up to 94%.

关键词： Stream processing Elasticity TVD EKF

来源：评论

学校读者我要写书评

暂无评论

Large Scale Graph Processing in a distributed Environment 1

引用

23rd international conference on Parallel and distributed computing (Euro-Par)

作者： Upadhyay, Nitesh Patel, Parita Cheramangalath, Unnikrishnan Srikant, Y. N. Indian Inst Sci Bangalore Karnataka India

ISBN: (数字)9783319751788

ISBN: (纸本)9783319751788;9783319751771

Large graphs are widely used in real world graph analytics. Memory available in a single machine is usually inadequate to process these graphs. A good solution is to use a distributed environment. Typical programming styles used in existing distributed environment frameworks are different from imperative programming and difficult for programmers to adapt. Moreover, some graph algorithms having a high degree of parallelism ideally run on an accelerator cluster. Error prone and lower level programming methods (memory and thread management) available for such systems repel programmers from using such architectures. Existing frameworks do not deal with the accelerator clusters. We propose a framework which addresses the previously stated deficiencies. Our framework automatically generates implementations of graph algorithms for distributed environments from the intuitive shared memory based code written in a high-level Domain Specific Language (DSL), Falcon. The framework analyses the intermediate representation, applies a set of optimizations and then generates Giraph code for a CPU cluster and MPI+OpenCL code for a GPU cluster. Experimental evaluations show efficiency and scalability of our framework.

关键词： distributed architecture Accelerator Cross-platform Graph processing DSL Falcon

来源：评论

学校读者我要写书评

暂无评论

PhotoNoCs: Design Simulation Tool for Silicon Integrated Photonics Towards Exascale systems 1

引用

23rd international conference on Parallel and distributed computing (Euro-Par)

作者： Crespo, Juan-Jose Alfaro-Cortes, Francisco J. Sanchez, Jose L. Univ Castilla La Mancha High Performance Networks & Architectures RAAP Gr Albacete Spain

ISBN: (数字)9783319751788

ISBN: (纸本)9783319751788;9783319751771

The need to greatly increase the number of compute nodes to design exascale systems raises numerous challenges that must be solved to obtain an efficient system in terms of cost, energy consumption and performance. Data movement is a critical barrier toward realizing exascale computing systems, and therefore the interconnection network is a key component of these systems. Among the different technologies that could contribute to an efficient interconnect, photonics is perhaps the most disruptive, due to its capabilities to generate, transmit, and receive high bandwidth signals with superior power efficiencies and inherent immunity to degradation. However, photonic interconnects lack from practical buffering, which make these networks circuit switched in its essence. Therefore, new network architectures are required, both to satisfy the requirements of data transfers between nodes and between the multiple computing resources of each multicore node. This paper presents PhotoNoCs as a tool which helps the computer architect to design and test new approaches of photonics interconnection systems at different levels: On-chip networks for multicore architectures and off-chip networks for the whole supercomputer.

关键词： Photonics SiP On-chip Exascale

来源：评论

学校读者我要写书评

暂无评论

Configuration of Slaves Based on the distributed Co-Simulation Protocol 23

Configuration of Slaves Based on the Distributed Co-Simulati...

引用

23rd IEEE international conference on Emerging Technologies and Factory Automation (ETFA)

作者： Krammer, Martin Benedikt, Martin VIRTUAL VEHICLE Res Ctr Graz Austria

ISBN: (纸本)9781538671085

Virtual system development becomes increasingly important in many industrial domains. It is considered to reduce development times, lower computing costs, and shorten time-to-market. Co-simulation is a particularly promising approach for modular and interoperable development. The Functional Mock-Up Interface (FMI) provides a standardized solution for integration of simulation models, tools and solvers. The integration and coupling of real-time and non-real-time systems still requires enormous efforts. The distributed Co-Simulation Protocol (DCP) is a novel, freely available specification to unify the integration of real-time and non-real-time systems of different providers. The DCP specifies a simulation cycle of five phases, including a configuration phase. It predetermines the configuration for data exchange of a co-simulation scenario. The exact generation of this configuration is not part of the DCP specification. This paper presents a co-simulation scenario description file format and an algorithm generating such a configuration. An XML schema description is used to describe a co-simulation scenario. We propose a bin packing algorithm which operates based on information provided with this XML file. This approach allows to create different configurations for the DCP in a fast and efficient way. To highlight the applicability of the proposed XML schema description and algorithm, a co-simulation scenario from the automotive domain is shown. It is used to generate three different DCP configurations, and to highlight their impact on network performance.

关键词： Protocols Data models Real-time systems Tools Computational modeling XML Automotive engineering

来源：评论

学校读者我要写书评

暂无评论

Towards the Development of WellFix: A Mobile-based Multi-Job Platform 19

Towards the Development of WellFix: A Mobile-based Multi-Job...

引用

Proceedings of the 2019 3rd international conference on Software and e-Business

作者： Rex P. Bringula Josiah Eleazar T. Regencia Rosula S. J. Reyes Ateneo de Manila University Philippines

ISBN: (纸本)9781450376495

We envision a community of well-maintained houses through the assistance of service providers (i.e., highly skilled individuals). In social entrepreneurship, it is desirable to empower local highly skilled workers within the community, thereby creating jobs not bound by the corporate environments. Toward this goal, this study determined the design considerations of WellFix -- a mobile-based system that allows posting of a wide range of on-demand services by the customers. An online content-validated survey form was distributed to 282 respondents to determine the initial design considerations of the mobile-based system. It was found that the client mostly needed house cleaning (59%), laundry (50%), carpentry (24%), electrical wiring (23%), and plumbing (15%) services. Respondents also reported that their walls (34%), roofs (33%), electrical outlets (30%), sinks (26%), and faucets (22%) need repairs. It is therefore concluded that the system must be able to handle different job requests and have potential contributions to the community. Future works were also discussed.

关键词： interface design entrepreneurship mobile computing mobile services information systems

来源：评论

学校读者我要写书评

暂无评论

Shallow Water Waves on a Deep Technology Stack: Accelerating a Finite Volume Tsunami Model Using Reconfigurable Hardware in Invasive computing 1

引用

23rd international conference on Parallel and distributed computing (Euro-Par)

作者： Poeppl, Alexander Damschen, Marvin Schmaus, Florian Fried, Andreas Mohr, Manuel Blankertz, Matthias Bauer, Lars Henkel, Jorg Schroeder-Preikschat, Wolfgang Bader, Michael Tech Univ Munich Dept Informat Boltzmannstr 3 D-85748 Garching Germany Karlsruhe Inst Technol Dept Informat Kaiserstr 12 D-76131 Karlsruhe Germany Friedrich Alexander Univ Erlangen Nurnberg FAU Dept Comp Sci 4 Martensstr 1 D-91058 Erlangen Germany

ISBN: (数字)9783319751788

ISBN: (纸本)9783319751788;9783319751771

Reconfigurable architectures are commonly used in the embedded systems domain to speed up compute-intensive tasks. They combine a reconfigurable fabric with a general-purpose microprocessor to accelerate compute-intensive tasks on the fabric while the general-purpose CPU is used for the rest of the workload. Through the use of invasive computing, we aim to show the feasibility of this technology for HPC scenarios. We demonstrate this by accelerating a proxy application for the simulation of shallow water waves using the i-Core, a reconfigurable processor that is part of the invasive computing multiprocessor system-on-chip. Using a floating-point custom instruction, the entire computation of numerical fluxes occurring in the application's finite volume scheme is performed by hardware accelerators.

关键词： Invasive computing High Performance computing Tsunami simulation Reconfigurable processor Resource-aware computing

来源：评论

学校读者我要写书评

暂无评论

Data Partitioning Strategies for Stencil Computations on NUMA systems 1

引用

23rd international conference on Parallel and distributed computing (Euro-Par)

作者： Feinbube, Frank Plauth, Max Knaust, Marius Polze, Andreas Univ Potsdam Hasso Plattner Inst Software Syst Engn Operating Syst & Middleware Grp Potsdam Germany

ISBN: (数字)9783319751788

ISBN: (纸本)9783319751788;9783319751771

Many scientific problems rely on the efficient execution of stencil computations, which are usually memory-bound. In this paper, stencils on two-dimensional data are executed on NUMA architectures. Each node of a NUMA system processes a distinct partition of the input data independent from other nodes. However, processors may need access to the memory of other nodes at the edges of the partitions. This paper demonstrates two techniques based on machine learning for identifying partitioning strategies that reduce the occurrence of remote memory access. One approach is generally applicable and is based on an uninformed search. The second approach caps the search space by employing geometric decomposition. The partitioning strategies obtained with these techniques are analyzed theoretically. Finally, an evaluation on a real NUMA machine is conducted, which demonstrates that the expected reduction of the remote memory accesses can be achieved.

关键词： NUMA Stencil computation Data partitioning

来源：评论

学校读者我要写书评

暂无评论

Approximation Algorithm for Scheduling a Chain of Tasks on Heterogeneous systems 1

引用

23rd international conference on Parallel and distributed computing (Euro-Par)

作者： Aba, Massinissa Ait Zaourar, Lilia Munier, Alix CEA LIST Comp & Design Environm Lab F-91191 Gif Sur Yvette France UPMC LIP6 4 Pl Jussieu F-75005 Paris France

ISBN: (数字)9783319751788

ISBN: (纸本)9783319751788;9783319751771

This paper presents an efficient approximation algorithm to solve the task scheduling problem on heterogeneous platform for the particular case of the linear chain of tasks. The objective is to minimize both the total execution time (makespan) and the total energy consumed by the system. For this purpose, we introduce a constraint on the energy consumption during execution. Our goal is to provides an algorithm with a performance guarantee. Two algorithms have been proposed;the first provides an optimal solution for preemptive scheduling. This solution is then used in the second algorithm to provide an approximate solution for non-preemptive scheduling. Numerical evaluations demonstrate that the proposed algorithm achieves a close-to-optimal performance compared to exact solution obtained by CPLEX for small instances. For large instances, CPLEX is struggling to provide a feasible solution, whereas our approach takes less than a second to produce a solution for an instance of 10000 tasks.

关键词： Linear chain of tasks Makespan Energy Approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

FCatch: Automatically Detecting Time-of-fault Bugs in Cloud systems 18

FCatch: Automatically Detecting Time-of-fault Bugs in Cloud ...

引用

23rd international conference on Architectural Support for Programming Languages and Operating systems (ASPLOS)

作者： Liu, Haopeng Wang, Xu Li, Guangpu Lu, Shan Ye, Feng Tian, Chen Univ Chicago Chicago IL 60637 USA Beihang Univ Beijing Peoples R China Huawei US R&D Ctr Santa Clara CA USA

ISBN: (纸本)9781450349116

It is crucial for distributed systems to achieve high availability. Unfortunately, this is challenging given the common component failures (i.e., faults). Developers often cannot anticipate all the timing conditions and system states under which a fault might occur, and introduce time-of-fault (TOF) bugs that only manifest when a node crashes or a message drops at a special moment. Although challenging, detecting TOF bugs is fundamental to developing highly available distributed systems. Unlike previous work that relies on fault-injection to expose TOF bugs, this paper carefully models TOF bugs as a new type of concurrency bugs, and develops FCatch to automatically predict TOF bugs by observing correct execution. Evaluation on representative cloud systems shows that FCatch is effective, accurately finding severe TOF bugs.

关键词： Timing Bugs Fault Tolerance distributed systems Bug Detection Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Job-shifting: An algorithm for online admission of non-preemptive aperiodic tasks in safety critical systems

引用

JOURNAL OF systems ARCHITECTURE 2018年 85-86卷 14-27页

作者： Syed, Ali Perez, Daniel Gracia Fohler, Gerhard Tech Univ Kaiserslautern Kaiserslautern Germany Thales Res & Technol Orsay France

Modern safety critical systems require certification in order to guarantee correct operation before system deployment. The certification process requires rigorous verification and validation, the efforts for which can be greatly reduced by using resource partitioning. However, Lackorzyriski et al. demonstrated that bandwidth reservation for event-triggered (ET) activities in partitioned systems may lead to significant bandwidth loss. In contrast, the online admission of ET activities can prevent bandwidth losses. However, the state-of-the-art approaches for online admission of ET activities fail to fulfill the requirements of safety critical systems as they do not support (i) partitioning, (ii) the industrial mixed-criticality task model or (iii) non-preemptive task execution. In this paper, we present job-shifting algorithm for online admission of non-preemptive aperiodic tasks in partitioned time-triggered environment. Our approach circumvents the bandwidth loss issue with partitioning, and provides guarantees similar to the bandwidth reservation technique such that the certification process of safety critical systems need not be modified. Our approach can be implemented on top of variety of hypervisors and can provide lower response-times for aperiodic tasks. Through evaluation, we demonstrate that our approach efficiently utilizes processor bandwidth and only incurs small scheduling overheads.

关键词： Real-time systems Scheduling algorithms Mixed-criticality Hierarchic scheduling Online aperiodic admission

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：