2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing最新文献_第5页

Accurate Energy Modelling for Many-Core Static Schedules 多核静态调度的精确能量建模

2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2015-03-04 DOI: 10.1109/PDP.2015.27

Simon Holmbacka, J. Keller, Patrick Eitschberger, J. Lilius

{"title":"Accurate Energy Modelling for Many-Core Static Schedules","authors":"Simon Holmbacka, J. Keller, Patrick Eitschberger, J. Lilius","doi":"10.1109/PDP.2015.27","DOIUrl":"https://doi.org/10.1109/PDP.2015.27","url":null,"abstract":"Static schedules can be a preferable alternative for applications with timing requirements and predictable behavior since the processing resources can be more precisely allocated for the given workload. Unused resources are handled by power management systems to either scale down or shut off parts of the chip to save energy. In order to efficiently implement power management, especially in many-core systems, an accurate model is important in order to make the appropriate power management decisions at the right time. For making correct decisions, practical issues such as latency for controlling the power saving techniques should be considered when deriving the system model, especially for fine timing granularity. In this paper we present an accurate energy model for many-core systems which includes switching latency of modern power saving techniques. The model is used when calculating an optimal static schedule for many-core task execution on systems with dynamic frequency levels and sleep state mechanisms. We create the model parameters for an embedded processor, and we validate it in practice with synthetic benchmarks on real hardware.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"600 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116289715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Automatic Distributed Code Generation from Formal Models of Asynchronous Concurrent Processes 异步并发进程形式化模型的自动分布式代码生成

2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2015-03-04 DOI: 10.1109/PDP.2015.96

Hugues Evrard, Frédéric Lang

{"title":"Automatic Distributed Code Generation from Formal Models of Asynchronous Concurrent Processes","authors":"Hugues Evrard, Frédéric Lang","doi":"10.1109/PDP.2015.96","DOIUrl":"https://doi.org/10.1109/PDP.2015.96","url":null,"abstract":"Formal process languages inheriting the concurrency and communication features of process algebras are convenient formalisms to model distributed applications, especially when they are equipped with formal verification tools (e.g., model-checkers) to help hunting for bugs early in the development process. However, even starting from a fully verified formal model, bugs are likely to be introduced while translating (generally by hand) the concurrent model -- which relies on high-level and expressive communication primitives -- into the distributed implementation -- which often relies on low-level communication primitives. In this paper, we present DLC, a compiler that enables distributed code to be generated from models written in a formal process language called LNT, which is equipped with a rich verification toolbox named CADP. The generated code can be either executed in an autonomous way (i.e., without requiring additional code to be defined by the user), or connected to external software through user-modifiable C functions. We present an experiment where DLC generates a distributed implementation from the LNT model of the Raft consensus algorithm.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127591611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 12

Efficient Implementation of a Fast Viewshed Algorithm on SIMD Architectures SIMD架构下快速视域算法的高效实现

2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2015-03-04 DOI: 10.1109/PDP.2015.62

J. C. Bravo, T. Sarjakoski, J. Westerholm

引用次数: 8

A Formal Specification and Prototyping Language for Multi-core System Management 多核系统管理的形式化规范和原型语言

2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2015-03-04 DOI: 10.1109/PDP.2015.107

A. Iliasov, A. Rafiev, Fei Xia, Rem Gensh, A. Romanovsky, A. Yakovlev

引用次数: 0

A Hybrid Scheduling Algorithm Based on Self-Timed and Periodic Scheduling for Embedded Streaming Applications 基于自定时和周期调度的嵌入式流应用混合调度算法

2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2015-03-04 DOI: 10.1109/PDP.2015.109

A. Dkhil, XuanKhanh Do, Stéphane Louise, Christine Rochange

{"title":"A Hybrid Scheduling Algorithm Based on Self-Timed and Periodic Scheduling for Embedded Streaming Applications","authors":"A. Dkhil, XuanKhanh Do, Stéphane Louise, Christine Rochange","doi":"10.1109/PDP.2015.109","DOIUrl":"https://doi.org/10.1109/PDP.2015.109","url":null,"abstract":"In this paper, we consider the problem of multiprocessor scheduling for safety-critical streaming applications modeled as acyclic data-flow graphs. To the best of our knowledge, most existing works have proposed periodic scheduling that ignore latency or can even have a negative impact on it: the results are quite far from those obtained under Self-Timed scheduling (STS). In this paper, we introduce a new scheduling policy noted Self-Timed Periodic (STP), which is an execution model combining self-timed scheduling with periodic scheduling. The proposed framework shows that the use of both strategies is possible and that they complement each other, STS improves the performance metrics of the programs, while the periodic model captures the timing aspects. We evaluate the performance of our scheduling policy for a set of 10 real-life streaming applications. We find that in most of the cases, our approach gives a significant improvement in latency compared to the Static Periodic Schedule (SPS), and results which are close to the best case latency of STS.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123524029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Color and Edge Directivity Descriptor on GPGPU GPGPU上的颜色和边缘方向性描述符

2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2015-03-04 DOI: 10.1109/PDP.2015.105

C. Iakovidou, Loukas Bampis, S. Chatzichristofis, Y. Boutalis, A. Amanatiadis

引用次数: 3

A Routing-Level Solution for Fault Detection, Masking, and Tolerance in NoCs noc中故障检测、屏蔽和容错的路由级解决方案

2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2015-03-04 DOI: 10.1109/PDP.2015.87

Xiaofan Zhang, M. Ebrahimi, Letian Huang, Guangjun Li, A. Jantsch

引用次数: 5

Optimality of Fundamental Parallel Algorithms on the Hierarchical Memory Machine, with GPU Implementation 分层存储机上基本并行算法的最优性，用GPU实现

2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2015-03-04 DOI: 10.1109/PDP.2015.46

K. Nakano, Yasuaki Ito

{"title":"Optimality of Fundamental Parallel Algorithms on the Hierarchical Memory Machine, with GPU Implementation","authors":"K. Nakano, Yasuaki Ito","doi":"10.1109/PDP.2015.46","DOIUrl":"https://doi.org/10.1109/PDP.2015.46","url":null,"abstract":"The Hierarchical Memory Machine (HMM) is a theoretical parallel computing model that captures the essence of CUDA-enabled GPU architecture. It has multiple streaming multiprocessors with a shared memory, and the global memory that can be accessed by all threads. The HMM has several parameters: the number d of streaming multiprocessors, the number p of threads per streaming multiprocessor, the number w of memory banks of each shared memory and the global memory, shared memory latency l, and global memory latency L. The main purpose of this paper is to discuss optimality of fundamental parallel algorithms running on the HMM. We first show that image convolution for an image with n × n pixels using a filter of size (2v+1) × (2v+1) can be done in O(n2/w+n2L/dp+n2v2/dw+n2v2l/dp) time units on the HMM. Further, we show that this parallel implementation is time optimal by proving the lower bound of the running time. We then go on to show that the product of two n × n matrices can be computed in O(n3/mw+n3L/mdp+n3/dw+n3l/dp) time units on the HMM if the capacity of the shared memory in each streaming multiprocessor is O(m2). This implementation is also proved to be time optimal. We further clarify the conditions for image convolution and matrix multiplication to hide the memory access latency overhead and to maximize the global memory throughput and the parallelism. Finally, we provide experimental results on GeForce GTX Titan to support our theoretical analysis.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115013211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Countermeasure Selection in SIEM Systems Based on the Integrated Complex of Security Metrics 基于安全度量综合复合体的SIEM系统对策选择

2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2015-03-04 DOI: 10.1109/PDP.2015.34

Igor Kotenko, E. Doynikova

引用次数: 14

Extending a Peer-Based Coordination Model with Composable Design Patterns 用可组合设计模式扩展基于对等的协调模型

2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Pub Date : 2015-03-04 DOI: 10.1109/PDP.2015.99

E. Kühn, Stefan Craß, Gerald Schermann

{"title":"Extending a Peer-Based Coordination Model with Composable Design Patterns","authors":"E. Kühn, Stefan Craß, Gerald Schermann","doi":"10.1109/PDP.2015.99","DOIUrl":"https://doi.org/10.1109/PDP.2015.99","url":null,"abstract":"Distributed applications require coordination of distributed software components in order to achieve a common goal. A coordination model that abstracts the complexity of network communication eases the development of such applications. The objective is to design collaboration with remote hosts in the same way as local interactions. Separation of coordination logic and application code increases maintainability, as components can be easily replaced with alternative versions. Different applications often have similar requirements on their coordination logic, e.g. concerning replication or load balancing. Instead of developing this functionality for each application separately, reusable generic patterns should be applied and adapted to the corresponding use case. In this paper, we describe how a coordination model based on asynchronous, data-driven communication among autonomous peers can be enhanced with a mechanism to support flexible coordination patterns. Patterns are adapted using parametrization and extension mechanisms, while complex coordination tasks can be modeled via composition of simpler sub-patterns. These concepts are demonstrated on an example where a MapReduce algorithm is incrementally designed and implemented using coordination patterns on top of a middleware that realizes the examined coordination model.","PeriodicalId":285111,"journal":{"name":"2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116353064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3