2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS)最新文献_第2页

Explorations of Data Swapping on Burst Buffer 突发缓冲区上数据交换的探索

2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2018-12-01 DOI: 10.1109/PADSW.2018.8644561

Tianqi Xu, Kento Sato, S. Matsuoka

{"title":"Explorations of Data Swapping on Burst Buffer","authors":"Tianqi Xu, Kento Sato, S. Matsuoka","doi":"10.1109/PADSW.2018.8644561","DOIUrl":"https://doi.org/10.1109/PADSW.2018.8644561","url":null,"abstract":"Burst buffers have been widely deployed in many supercomputers to absorb bursty I/O and accelerate I/O performance. Previous work has shown that with burst buffer systems, I/O operations from computer nodes can be greatly accelerated. While the lack of data swapping supports on burst buffer leads to under-utilization and application failure issues. In addition, the effects of data replacement algorithms on application performance and the suitability of each algorithm for the target application are unclear. In this paper, we address these challenges by simulating data swapping on burst buffers with different data replacement strategies. Trace logs from a set of real-world HPC applications are used with different data replacement algorithms to show the behavior of representative HPC applications. From the results, we found that most HPC applications can still achieve full performance when using a buffer size that is far less than the total access space of the application, which can lead to a huge reduction on the required capacity for burst buffer. Moreover, we found that data replacement algorithms can have significant impact on the application performance. Our finding show the importance of having data swapping in reducing the required capacity and guide the future design of the usage of burst buffer.","PeriodicalId":361947,"journal":{"name":"2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127198067","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

Building an Ethereum-Based Decentralized Smart Home System 构建基于以太坊的去中心化智能家居系统

2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2018-12-01 DOI: 10.1109/PADSW.2018.8644880

Quanqing Xu, Zhaozheng He, Zengxiang Li, Mingzhong Xiao

{"title":"Building an Ethereum-Based Decentralized Smart Home System","authors":"Quanqing Xu, Zhaozheng He, Zengxiang Li, Mingzhong Xiao","doi":"10.1109/PADSW.2018.8644880","DOIUrl":"https://doi.org/10.1109/PADSW.2018.8644880","url":null,"abstract":"Blockchain is first introduced by Bitcoin in 2009 and developers all around the world have been trying to apply blockchain in different areas, like finance services, credit and ownership management, resource sharing, investment management, Internet of Things (IoT) etc. Ethereum is a Blockchain 2.0 platform that allows developers to build a Decentralized Application (DApp) without building a new blockchain from the scratch. IoT is the technology to embed all the physical devices with sensors and chips to provide automation process via machine-to-machine communication. Blynk is a platform that provides iOS and Android application for the users and developers to collect data from control microcontroller. This paper is aiming to build a system with Ethereum private Blockchain, Raspberry Pi (RPi), Blynk platform, DHT11 temperature and humidity sensors. The system is a proof-of-concept prototype to simulate smart home applications. It collects the real-time room temperature and humidity by DHT11 via Raspberry Pi. The sensor data will be updated to the Blynk App and stored on the smart contract deployed on the Ethereum private Blockchain. If the real-time temperature or humidity value exceeds the threshold value set by the users, red or green LEDs will be turned on as warnings. This system can be improved by some possible future work.","PeriodicalId":361947,"journal":{"name":"2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133731504","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}

引用次数: 25

Design Issues of Novel Round Robin Scheduling Scheme to Improve Processing Performance in a 5G MMWave Network 提高5G毫米波网络处理性能的新型轮循调度方案设计问题

2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2018-12-01 DOI: 10.1109/PADSW.2018.8645030

Shin-Jer Yang, Hsin-Chung Chen

{"title":"Design Issues of Novel Round Robin Scheduling Scheme to Improve Processing Performance in a 5G MMWave Network","authors":"Shin-Jer Yang, Hsin-Chung Chen","doi":"10.1109/PADSW.2018.8645030","DOIUrl":"https://doi.org/10.1109/PADSW.2018.8645030","url":null,"abstract":"Due to mature technologies in cloud computing, and the fast development of sensing devices, IoT applications popularized in recent years have become the main contributors to a drastic increasing in future wireless mobile network data traffic. Compared to 4G LTE, 5G provides higher network traffic and lower packet latency. However, 5G that transmits data to thousands of users at a speed of 10 Gbps still requires proper allocation of mobile network bandwidth resources. When B-RR executes resource allocation on the 5G mmWave network, the problem of inefficiency when the Channel Quality Indicator (CQI) value is nonexistent but data transmission and UE polling continue to take place is likely to be encountered, resulting in network resource loss during UE data transmission. Therefore, a new NRRS was proposed in this paper to improve B-RR and achieve more efficient resource allocation. The NRRS scheduling scheme focuses on the use of a CQI report value as the basis for resource allocation. NRRS and B-RR simulation experiments were carried out to compare their performance. The simulation results of KPIs indicate that the Cell latency can achieve 27%, 11%, 15%, and 13% improvement ratios; Throughput can attain 2%, 41%, 35%, and 30% improvement ratios; and also the Data failure ratio can get 19%, 24%, 33%, and 16% improvement ratios in 10UEs, 20UEs, 50UEs, and 100UEs, respectively. Preliminary research results have proven that the NRRS scheduling scheme can obtain a lower Cell latency, higher Throughput and lower Data failure ratio, which are highly conducive to allocating better bandwidth resources and more efficient data retransmissions in the 5G mmWave network.","PeriodicalId":361947,"journal":{"name":"2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114966747","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

JCDTA: The Data Trading Archtecture Design in JointCloud Computing 联合云计算中的数据交易架构设计

2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2018-12-01 DOI: 10.1109/PADSW.2018.8644552

Xikun Yue, Huaimin Wang, W. Liu, Wei Li, Peichang Shi, Xue Ouyang

{"title":"JCDTA: The Data Trading Archtecture Design in JointCloud Computing","authors":"Xikun Yue, Huaimin Wang, W. Liu, Wei Li, Peichang Shi, Xue Ouyang","doi":"10.1109/PADSW.2018.8644552","DOIUrl":"https://doi.org/10.1109/PADSW.2018.8644552","url":null,"abstract":"JointCloud computing is a new generation cloud computing model based on collaboration among Cloud Service Providers, making resources from multiple clouds deeply integrated., and supporting customize cloud service. To achieve the data confirmation Right when doing data trading to prevent resell is one of the most important challenges faced by such JointCloud environment. In this paper, we propose the JointCloud Computing Data Trading Architecture (JCDTA), an optimized data trading architecture for cross-stakeholder. Firstly, the announced mechanism is used to extract the data resources summary and the owner information into blockchain. Secondly, the untampering of the blockchain is used to record the data resources information, such as data resources statement information, data resources transaction records and data resources operation records. Finally, the supervision mechanism confirms the declaration of the data sources while the encryption technology ensures the privacy of the data resources. JCDTA guarantees the security and the reliability of data trading in the JointCloud environment and ensures the value invariance of data resources.","PeriodicalId":361947,"journal":{"name":"2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115002153","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

Co- Location Resistant Virtual Machine Placement in Cloud Data Centers 云数据中心中抗共定位的虚拟机放置

2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2018-12-01 DOI: 10.1109/PADSW.2018.8644849

A. Agarwal, T. Duong

引用次数: 4

JALAD: Joint Accuracy-And Latency-Aware Deep Structure Decoupling for Edge-Cloud Execution 边缘云执行的联合精度和延迟感知深度结构解耦

2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2018-12-01 DOI: 10.1109/PADSW.2018.8645013

Hongshan Li, Chenghao Hu, Jingyan Jiang, Zhi Wang, Yonggang Wen, Wenwu Zhu

{"title":"JALAD: Joint Accuracy-And Latency-Aware Deep Structure Decoupling for Edge-Cloud Execution","authors":"Hongshan Li, Chenghao Hu, Jingyan Jiang, Zhi Wang, Yonggang Wen, Wenwu Zhu","doi":"10.1109/PADSW.2018.8645013","DOIUrl":"https://doi.org/10.1109/PADSW.2018.8645013","url":null,"abstract":"Recent years have witnessed a rapid growth of deep-network based services and applications. A practical and critical problem thus has emerged: how to effectively deploy the deep neural network models such that they can be executed efficiently. Conventional cloud-based approaches usually run the deep models in data center servers, causing large latency because a significant amount of data has to be transferred from the edge of network to the data center. In this paper, we propose JALAD, a joint accuracy- and latency-aware execution framework, which decouples a deep neural network so that a part of it will run at edge devices and the other part inside the conventional cloud, while only a minimum amount of data has to be transferred between them. Though the idea seems straightforward, we are facing challenges including i)how to find the best partition of a deep structure; ii)how to deploy the component at an edge device that only has limited computation power; and iii)how to minimize the overall execution latency. Our answers to these questions are a set of strategies in JALAD, including 1)A normalization based in-layer data compression strategy by jointly considering compression rate and model accuracy; 2)A latency-aware deep decoupling strategy to minimize the overall execution latency; and 3)An edge-cloud structure adaptation strategy that dynamically changes the decoupling for different network conditions. Experiments demonstrate that our solution can significantly reduce the execution latency: it speeds up the overall inference execution with a guaranteed model accuracy loss.","PeriodicalId":361947,"journal":{"name":"2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129739731","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}

引用次数: 100

Accurate Performance Modeling of Uplink Transmission in NB-IoT NB-IoT中上行传输的精确性能建模

2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2018-12-01 DOI: 10.1109/PADSW.2018.8644571

Huikang Li, Gonglong Chen, Yihui Wang, Yi Gao, Wei Dong

{"title":"Accurate Performance Modeling of Uplink Transmission in NB-IoT","authors":"Huikang Li, Gonglong Chen, Yihui Wang, Yi Gao, Wei Dong","doi":"10.1109/PADSW.2018.8644571","DOIUrl":"https://doi.org/10.1109/PADSW.2018.8644571","url":null,"abstract":"With the development of LPWA (Low Power Wide Area)technology, the emerging NB-IoT (Narrowband Internet of Things)has attracted much attention and enabled a wide range of applications. An uplink of NB-IoT is a link from a user equipment (UE)to a base station (BS). Uplink transmission is a key component of NB-IoT, accomplishing the sensor data collection task for many applications. However, the performance of uplink transmission has not been rigorously analyzed in the current literature, while uplink performance degradation like long latency could be harmful to many applications with strict uplink performance requirements. In this work, we show a way of mathematically analyzing the performance of uplink transmission for NB-IoT systems, concerning the transmission latency and transmission reliability. Our model is accurate with consideration of the protocol details and the new features of NB-IoT, including link quality, packet size, channel access contention, and etc. We validate the analytical results through detailed simulations. Results show that our analytical model can achieve 83% accuracy for latency calculation and 96% accuracy for reliability calculation. Moreover, we demonstrate that the analytical results can be used to aid protocol design for performance optimization, e.g., repetition number tuning for reducing the transmission latency.","PeriodicalId":361947,"journal":{"name":"2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131090628","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}

引用次数: 11

TLed: Time-Lived Based Congestion and Rate Control for Video in Named Data Networking 命名数据网络中基于时间的视频拥塞和速率控制

2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2018-12-01 DOI: 10.1109/PADSW.2018.8644975

Zhao Zhang, Huadong Ma, Liang Liu

{"title":"TLed: Time-Lived Based Congestion and Rate Control for Video in Named Data Networking","authors":"Zhao Zhang, Huadong Ma, Liang Liu","doi":"10.1109/PADSW.2018.8644975","DOIUrl":"https://doi.org/10.1109/PADSW.2018.8644975","url":null,"abstract":"Named Data Networking (NDN), a revolution of the IP architecture, provides an information-centric paradigm to transmit video traffic which occupies most of the Internet traffic. However, the control schemes in the field of video NDN research can easily result in full bottleneck bandwidth at the cost of high video delay and frequent packet loss. This is because the loss-based or transient-queue-delay-based congestion control schemes respond to the signal after the congestion is formed. And NDN multi-source feature can't make the loss and delay-based signals accurately reflect the network situation. In addition, the current video applications need to choose the suitable video rate to stream across the network. The bandwidth estimation scheme of video rate control ignoring multi-source reduces accuracy in NDN. In this paper, we firstly build a max-plus algebra based model to characterize the interest-data transmission process for video consumer and to estimate the NDN bandwidth delay product. The hops (lived time)that data pass through from the producer to the consumer represent the multi-source feature in the model. Then we propose a Time-Lived based congestion and rate control scheme for the NDN video consumer. Extensive experiments have been conducted to evaluate our scheme from the perspective of throughput, delay, and queue length. The results show that our scheme can improve the throughput of the video consumer while reducing the round trip time by shortening the queue length.","PeriodicalId":361947,"journal":{"name":"2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130433044","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

Data Locality Exploitation in Cache Compression 缓存压缩中的数据局部性利用

2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2018-12-01 DOI: 10.1109/PADSW.2018.8644558

Qi Zeng, R. Jha, Shigang Chen, J. Peir

{"title":"Data Locality Exploitation in Cache Compression","authors":"Qi Zeng, R. Jha, Shigang Chen, J. Peir","doi":"10.1109/PADSW.2018.8644558","DOIUrl":"https://doi.org/10.1109/PADSW.2018.8644558","url":null,"abstract":"State-of-the-art cache compression methods compress multiple neighboring blocks often called as a sector into a single 64-byte block to effectively enlarge the cache capacity. A compressed block is created by storing 4-byte data patterns as dictionary entries and pointers to them for compressing multiple blocks. Furthermore, sector-based tag array maintains one-to-one mapping between tag and data arrays in order to preserve conventional cache access mechanism. We present a dual-block compression method which uses an entire uncompressed block as dictionary and compresses multiple neighboring blocks in a separate companion block to provide a larger dictionary for better compression ratios. Furthermore, we introduce the concept of buddy-set which expands the compressible candidate blocks across two adjacent cache sets to enlarge the scope of compression. Performance evaluations for the last-level cache show that the proposed dual-block compression with expansion of compressible candidates in the buddy-set can enlarge the cache by an average of 60% while current state-of-art compression proposal has only 29% improvement. The proposed scheme demonstrates 8.9% speedup over caches without compression.","PeriodicalId":361947,"journal":{"name":"2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125480880","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

Concurrent Hybrid Breadth-First-Search on Distributed PowerGraph for Skewed Graphs 斜图分布式功率图的并行混合宽度优先搜索

2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2018-12-01 DOI: 10.1109/PADSW.2018.8644918

Zengxiang Li, Shen Ren, Sifei Lu, Jiachun Guo, Wentong Cai, Q. Zheng, R. Goh

{"title":"Concurrent Hybrid Breadth-First-Search on Distributed PowerGraph for Skewed Graphs","authors":"Zengxiang Li, Shen Ren, Sifei Lu, Jiachun Guo, Wentong Cai, Q. Zheng, R. Goh","doi":"10.1109/PADSW.2018.8644918","DOIUrl":"https://doi.org/10.1109/PADSW.2018.8644918","url":null,"abstract":"Large-scale graph-structured computation is becoming increasingly important for various data analytics applications. However, most distributed graph processing frameworks do not directly support efficient implementation of sophisticated algorithms requiring massive graph traversals. In this paper, we propose concurrent hybrid breadth-first-search (BFS) algorithm on a popular distributed graph processing framework (Power-Graph and its optimized version PowerLyra). It leverages the small-world property of skewed graphs which apply to most realworld data sets. Hybrid BFS algorithm changes graph traversal direction to save computational workload and message transmissions. Concurrent BFS algorithm enables running multiple BFS simultaneously while sharing vertex explorations efficiently with bit operations. Extensive experiments are conducted to evaluate performance and scalability on a multi-core computer and a cluster of AWS instances. Concurrent hybrid BFS algorithm dramatically increases graph traversal efficiency with respect to the increasing number of concurrent BFS traversals. Compared with PowerGraph, PowerLyra uses fewer resources, while achieving significantly higher performance and better scalability.","PeriodicalId":361947,"journal":{"name":"2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126820065","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