2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)最新文献

{"title":"Low-Energy Dynamic Clustering Scheme for Wireless Sensor Networks","authors":"Wenqi Zhang, Jingjing Yu, Xingchun Liu, Ying Tao, Shubo Ren","doi":"10.1109/PDCAT46702.2019.00031","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00031","url":null,"abstract":"Wireless Sensor Networks (WSNs) are mainly used to collaboratively sense and process information in the monitoring area. Sensor nodes have limited energy and are inconvenient to be replaced when the monitoring area is remote or dangerous. That makes the energy consumption an important problem for WSNs. For heterogeneous network, where sensor nodes have different energy, existing clustering methods only consider single factor, heterogeneity of node energy, for head selection. This paper applies fuzzy logic to consider multiple factors for clustering with the purpose of prolonging the lifetime of the network. Important factors, such as relative density of nodes in the network and the relative distance from the nodes to the base station, are considered together with the initial energy to select the cluster head dynamically. Simulation results demonstrated that proposed clustering algorithm can balance the energy consumption of the nodes in network and effectively prolong the survival time of the network, thus ensuring the accuracy of data aggregation.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124231825","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}

{"title":"Min-Max Movement of Sink-Based Mobile Sensors in the Plane for Barrier Coverage","authors":"Wenjie Zou, Longkun Guo, Peihuang Huang","doi":"10.1109/PDCAT46702.2019.00012","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00012","url":null,"abstract":"Barrier coverage is a long-lasting problem in mobile and wireless sensor networks, particularly for energy-critical applications. Recently, practical applications propose new barrier coverage applications of using sink-based mobile sensors, with the aim of minimizing the maximum energy consumed by sensor movement. In the problem, we are a set of sinks distributed on the plane each of which can emit mobile sensors with an identical radius. The task is to cover a given barrier using the mobile sensors emitted from the sinks, such that the maximum movement of the sensors is minimized. In this paper, we first design an algorithm for optimally solving the problem based on the key observation of the property against the so-called movement parity and tangent equilibrium points between the sinks. Then based on a more sophisticated investigation of the geometric property of an optimum solution, we improve the runtime of the algorithm to O(k) for k being the number of sink stations, attaining possibly the best runtime of the problem.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115781277","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}

{"title":"TrustZone for Supervised Asymmetric Multiprocessing Systems","authors":"Mahdi Amiri-Kordestani, D. Eyers, Zhiyi Huang, M. Biglari-Abhari","doi":"10.1109/PDCAT46702.2019.00067","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00067","url":null,"abstract":"Many modern forms of asymmetric multiprocessing (AMP) architecture use hypervisors to increase software security by isolating the system software in virtual machines. However, efficient virtualisation depends on hardware support that is not available across all products. Within modern ARM architectures, the aforementioned software isolation can also be implemented using ARM TrustZone technology. This paper presents a TrustZone-based AMP architecture (TZ-AMP) that can consolidate multiple system software environments securely on devices that lack hardware virtualisation support. We evaluate our prototype on the ARMv7-A architecture, and demonstrate TrustZone-based context-switching performance in the order of microseconds, confirming that TZ-AMP maintains high performance while also achieving hardware-backed software security.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115969785","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}

{"title":"An OpenCL-Like Offload Programming Framework for SX-Aurora TSUBASA","authors":"H. Takizawa, Shinji Shiotsuki, Naoki Ebata, Ryusuke Egawa","doi":"10.1109/PDCAT46702.2019.00059","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00059","url":null,"abstract":"This paper presents an OpenCL-like offload programming framework for NEC SX-Aurora TSUBASA (SXAurora). Unlike traditional vector systems, one node of an SXAurora system consists of a host processor and some vector processors on PCI-Express cards, which are called a vector host and vector engines, respectively. Since the standard OpenCL execution model does not naturally fit in the vector engine, this paper discusses how to adapt the OpenCL specification to SXAurora while considering the trade off between performance and code portability. Performance evaluation results clearly demonstrate that, with a moderate programming effort, the proposed framework can express the collaboration between a vector host and a vector engine so as to make a good use of both of the two different processors. By delegating the right task to the right processor, an OpenCL-like program can fully exploit the performance of SX-Aurora.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123725972","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}

{"title":"Information Management Software Systems for Improving Reliability","authors":"Kyaw Zaw Ye, S. M. Maung, Z. Htet, K. T. Aung, Aung Myat Kyaw, Pyae Sone Ko Ko, Sithu Thant Zin","doi":"10.1109/PDCAT46702.2019.00103","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00103","url":null,"abstract":"In this paper, we developed method and software system to ensure reliability and technical diagnostics for improving efficiency of high performance computing system (HPC). This paper is devoted to the development of study and analyze the problems of remote control system for increasing reliability of the information management. Therefore we can realize and implement the software design of the information management for improving reliability.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"226 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122689740","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}

{"title":"Fengyun-4A Meteorological Satellite Data Service System","authors":"Yonggang Qi, Jiashen Zhang, Zhe Xu, Di Xian","doi":"10.1109/PDCAT46702.2019.00087","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00087","url":null,"abstract":"This paper introduces the characteristics and the new technologies applied in Fengyun-4A(FY-4A) Data Service System. The system is an important part of Fengyun-4(FY-4) series satellite ground application system, and also is the new generation platform for meteorological satellite data sharing services. The system integrates several high-performance servers, high availability disk array, large-scale automated tape library as well as operation system, database, storage software and application software, all of which constitutes archive and service application clusters. The system adopts cloud-computing technology, big data technology, WEBGIS technology to establish a stable, reliable and secure operational satellite data archive platform, which not only provides data retrieval and download services, but also provides various auxiliary means and information assistance.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"85 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115842504","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}

{"title":"Real-Time Stream Data Processing at Scale","authors":"M. HoseinyFarahabady, A. Jannesari, Wei Bao, Z. Tari, Albert Y. Zomaya","doi":"10.1109/PDCAT46702.2019.00020","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00020","url":null,"abstract":"A typical scenario in a stream data-flow processing engine is that users submit continues queries in order to receive the computational result once a new stream of data arrives. The focus of the paper is to design a dynamic CPU cap controller for stream data-flow applications with real-time constraints, in which the result of computations must be available within a short time period, specified by the user, once a recent update in the input data occurs. It is common that the stream data-flow processing engine is deployed over a cluster of dedicated or virtualized server nodes, e.g., Cloud or Edge platform, to achieve a faster data processing. However, the attributes of incoming stream data-flow might fluctuate in an irregular way. To effectively cope with such unpredictable conditions, the underlying resource manager needs to be equipped with a dynamic resource provisioning mechanism to ensure the real-time requirements of different applications. The proposed solution uses control theory principals to achieve a good utilization of computing resources and a reduced average response time. The proposed algorithm dynamically adjusts the required quality of service (QoS) in an environment when multiple stream & data-flow processing applications concurrently run with unknown and volatile workloads. Our study confirms that such a unpredictable demand can negatively degrade the system performance, mainly due to adverse interference in the utilization of shared resources. Unlike prior research studies which assumes a static or zero correlation among the performance variability among consolidated applications, we presume the prevalence of shared-resource interference among collocated applications as a key performance-limiting parameter and confront it in scenarios where several applications have different QoS requirements with unpredictable workload demands. We design a low-overhead controller to achieve two natural optimization objectives of minimizing QoS violation amount and maximizing the average CPU utilization. The algorithm takes advantage of design principals in model predictive control theory for elastic allocation of CPU share. The experimental results confirm that there is a strong correlation in performance degradation among consolidation strategies and the system utilization for obtaining the capacity of shared resources in a non-cooperative manner. The results confirm that the proposed solution can reduce the average latency of delay-sensitive applications by 17% comparing to the results of a well established heuristic called Class-Based Weighted Fair Queuing (CFWFQ). At the same time, the proposed solution can prevent the QoS violation incidents by 62%.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127080263","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}

{"title":"Adaptive Power Reallocation for Value-Oriented Schedulers in Power-Constrained HPC","authors":"Nirmal Kumbhare, Aniruddha Marathe, A. Akoglu, S. Hariri, G. Abdulla","doi":"10.1109/PDCAT46702.2019.00035","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00035","url":null,"abstract":"In the exascale era, HPC systems are expected to operate under different system-wide power-constraints. For such power-constrained systems, improving per-job flops-per-watt may not be sufficient to improve the total HPC productivity as more number of scientific applications with different compute intensities are migrating to the HPC systems. To measure HPC productivity for such applications, we utilize a monotonically decreasing time-dependent value function, called job-value, with each application. A job-value function represents the value of completing a job for an organization. We begin by exploring the trade-off between two commonly used static power allocation strategies (uniform and greedy) in a power-constrained oversubscribed system. We simulate a large-scale system and demonstrate that, at the tightest power constraint, the greedy allocation can lead to 30% higher productivity compared to the uniform allocation whereas, the uniform allocation can gain up to 6% higher productivity at the relaxed power constraint. We then propose a new dynamic power allocation strategy that utilizes power-performance models derived from offline data. We use these models for reallocating power from running jobs to newly arrived jobs to increase overall system utilization and productivity. In our simulation study, we show that compared to static allocation, the dynamic power allocation policy improves node utilization and job completion rates by 20% and 9%, respectively, at the tightest power constraint. Our dynamic approach consistently earns up to 8% higher productivity compared to the best performing static strategy under different power constraints.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131849826","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}

{"title":"RNC: Reliable Network Property Classifier Based on Graph Embedding","authors":"Hao Liao, Qi-xin Liu, Alexandre Vidmer, Mingyang Zhou, Rui Mao","doi":"10.1109/PDCAT46702.2019.00068","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00068","url":null,"abstract":"In the past two decades, analyzing the information network has been intensively studied from various disciplines. Small world property and scale-free property prevail in network science research. The comparison and classification of different kinds of graphs are extremely important. However, how to design a robust and accurate classification with deep learning techniques for network property still lack enough attention, which is a vital task in various application scenarios. In this paper, we proposed the reliable network property classifier based on graph embedding(RNC) to classify the network property (scale free or small world property). In order to process non-euclidean data, we embedded each network into an image and use dimensional reduction, rasterization, and convolutional neural networks to complete the classification problem. The method can effectively accomplish classification tasks in not only artificial networks but also real networks. Besides, RNC wins greatly in terms of robustness on real networks, showing the robustness of RNC against the incomplete structure of the network.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"80 7-8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114009019","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}

{"title":"Research on Differential Privacy for Medical Health Big Data Processing","authors":"Yugu Hu, Lina Ge, Guifen Zhang, Donghong Qin","doi":"10.1109/PDCAT46702.2019.00036","DOIUrl":"https://doi.org/10.1109/PDCAT46702.2019.00036","url":null,"abstract":"As big data, medical digitalization, and wearable devices continue to evolve, these technologies are driving the advancement of clinical medicine, genomics, and wearable health while also posing a risk of privacy breaches. For the disclosure of medical privacy issues, some methods and systems combining differential privacy protection applied in the clinical, genomic and wearable fields have been summarized, analyzed and compared. Finally, through the investigation and research, the assumptions and prospects for future research hotspots are given.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115522236","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}