2011 40th International Conference on Parallel Processing Workshops最新文献_第5页

From Spatial Reuse to Transmission Power Control for CSMA/CA Based Wireless Ad Hoc Networks 基于CSMA/CA的无线自组网从空间复用到传输功率控制

2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.12

H. Luo, E. Wu, Gen-Huey Chen

引用次数: 5

Analyzing the Effects of Multicore Architectures and On-Host Communication Characteristics on Collective Communications 多核架构和主机上通信特性对集体通信的影响分析

2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.15

Joshua Ladd, Manjunath Gorentla Venkata, R. Graham, Pavel Shamis

{"title":"Analyzing the Effects of Multicore Architectures and On-Host Communication Characteristics on Collective Communications","authors":"Joshua Ladd, Manjunath Gorentla Venkata, R. Graham, Pavel Shamis","doi":"10.1109/ICPPW.2011.15","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.15","url":null,"abstract":"Shared memory optimizations for blocking collective communications implemented for multi-core, and distributed systems have previously shown to improve the performance of these operations. Such previous studies have tended to neglect the architecture of multi-core node and shared-memory communication characteristics. In this paper, we examine in detail the impact of on-node memory and cache hierarchy, and the optimization opportunities these provide, on the performance of the barrier and broadcast collective operations. The primary contribution of this paper is the demonstration of how exploiting the local memory-hierarchy impacts the performance of these operations in the distributed system context. Our results show that factors such as the location of communicating process in the node, number of communication processes, amount of shared-memory communication, and the amount of inter-socket (Central Processing Unit (CPU) socket) communication affect latency-sensitive and bandwidth-sensitive collective operations. The effect of these parameters varies on the type of operations, and are coupled to the architecture of the shared-memory node and the scale of collective operation. We have seen that for 3,072 processes on Jaguar, and considering the socket layout in collective communication algorithm improves the large-data MPI Bcast () performance by 50% and MPI Barrier by 40% when compared to neglecting this architectural feature. For 512 processes job on Smoky, the corresponding improvement is 38%, and an order of magnitude, respectively. Small data broadcast performance is not noticeably impacted on Jaguar, when considering the shared-memory hierarchy, and on Smoky the corresponding performance improvement is 3%.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124107253","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

Interval Based I/O: A New Approach to Providing High Performance Parallel I/O 基于间隔的I/O:一种提供高性能并行I/O的新方法

2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.45

Jeremy S. Logan, P. Dickens

引用次数: 0

The Power Efficiency of GPUs in Multi Nodes Environment with Molecular Dynamics 基于分子动力学的多节点环境下gpu的功耗效率研究

2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.43

T. Udagawa, M. Sekijima

引用次数: 7

A Lightweight Secure Data Aggregation Protocol for Wireless Sensor Networks 一种用于无线传感器网络的轻量级安全数据聚合协议

2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.24

Hung-Min Sun, Chiung-Hsun Chen, Po-Chi Li

引用次数: 9

A Generic Scheme for Secure Data Sharing in Cloud 云环境下安全数据共享的通用方案

2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.51

Yanjiang Yang, Youcheng Zhang

{"title":"A Generic Scheme for Secure Data Sharing in Cloud","authors":"Yanjiang Yang, Youcheng Zhang","doi":"10.1109/ICPPW.2011.51","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.51","url":null,"abstract":"Working in various service models ranging from SaaS, PaaS, to IaaS, cloud computing is a new revolution in IT, and could reshape the business model of how the IT industry works today. Storage services are a fundamental component of the cloud computing paradigm. By exploiting the storage services, users outsource their data to the cloud so as to enjoy the reduced upfront maintenance and capital costs. However, a security challenge associated with data outsourcing is how to prevent data abuses by the cloud. It has been commonly accepted that data encryption offers a good solution to this problem. With data encryption, an issue arises when the data owner who outsourced the data wants to revoke some data consumers' access privileges, which normally involves key re-distribution and data re-encryption. In this work, we propose a generic scheme to enable fine-grained data sharing over the cloud, which does not require key-redistribution and data re-encryption whatsoever. The main primitives we make use of are attribute-based/predicate encryption and proxy re-encryption, but our construction is not restricted to any specific scheme of its kind. Our scheme has a number of advantages over other similar proposals in the literature.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129649151","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}

引用次数: 50

Job Coscheduling on Coupled High-End Computing Systems 耦合高端计算系统的作业协同调度

2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.59

Wei Tang, N. Desai, V. Vishwanath, Daniel Buettner, Z. Lan

引用次数: 4

Optimal Multipath Planning for Neyman-Pearson Detection in Wireless Sensor Networks 无线传感器网络中Neyman-Pearson检测的最优多路径规划

2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.63

Yung-Liang Lai, Jehn-Ruey Jiang

{"title":"Optimal Multipath Planning for Neyman-Pearson Detection in Wireless Sensor Networks","authors":"Yung-Liang Lai, Jehn-Ruey Jiang","doi":"10.1109/ICPPW.2011.63","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.63","url":null,"abstract":"Target detection is one of the most important services in wireless sensor networks (WSNs) for making decisions about the presence of specified targets by collecting sensed data from geographically distributed wireless sensors nodes. In this paper, we consider designing target detection systems in WSNs on the basis of the Neyman-Pearson Detector (NPD), a statistical decision making method of which accuracy depends on the amount of data collected within a limited time period. We propose the Optimal Multipath Planning Algorithm (OMPA) based on the maximum flow minimum cost algorithm for WSNs to set up paths to reliably deliver as many as possible data packets from data sources to the sink node. OMPA is optimal in the sense that it sets up the maximum number of node-disjoint paths composed of the links with the minimized expected transmission time (ETT). We also evaluate OMPAÂ¶V decision quality with the help of the Receiver Operating Characteristic (ROC) curves and compare OMPA with the Minimum Cost Path Planning Algorithm (MCPPA) in terms of the detection decision quality and the number of available paths at the presence of node failures.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133092939","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}

引用次数: 0

Embedded Network Intrusion Detection Systems with a Multi-core Aware Packet Capture Module 基于多核感知包捕获模块的嵌入式网络入侵检测系统

2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.37

Chia-Hao Hsu, Sheng-de Wang

引用次数: 6

Time-Synchronized versus Self-Organized K-Coverage Configuration in WSNs 无线传感器网络的时间同步与自组织k覆盖配置

2011 40th International Conference on Parallel Processing Workshops Pub Date : 2011-09-13 DOI: 10.1109/ICPPW.2011.34

M. Wueng, P. Sahoo, I. Hwang

引用次数: 4