2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops最新文献

筛选
英文 中文
The 2nd Workshop on Planetary-Scale Distributed Systems (W-PSDS 2014) 第二届行星尺度分布式系统研讨会(W-PSDS 2014)
J. Leitao, R. Vilaça
{"title":"The 2nd Workshop on Planetary-Scale Distributed Systems (W-PSDS 2014)","authors":"J. Leitao, R. Vilaça","doi":"10.1109/SRDSW.2014.32","DOIUrl":"https://doi.org/10.1109/SRDSW.2014.32","url":null,"abstract":"Message from the workshop chairs of the 2nd Workshop on Planetary-Scale Distributed Systems (W-PSDS 2014).","PeriodicalId":140194,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122667543","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
SeRAVi: A Spatio-Temporal Data Distribution Visualization System for Mobile Sensor Data Retrieval 一个用于移动传感器数据检索的时空数据分布可视化系统
Haruka Sazaki, A. Kanzaki, T. Hara, S. Nishio
{"title":"SeRAVi: A Spatio-Temporal Data Distribution Visualization System for Mobile Sensor Data Retrieval","authors":"Haruka Sazaki, A. Kanzaki, T. Hara, S. Nishio","doi":"10.1109/SRDSW.2014.14","DOIUrl":"https://doi.org/10.1109/SRDSW.2014.14","url":null,"abstract":"With the development of sensor technologies in recent years, mobile sensor devices such as smartphones have become widely used. Thus, there has been much attention to study on utilizing mobile sensor data generated by these devices. Here, the distribution of such kind of data tends to be spatially and temporally ununiform. Therefore, in order to assists users to retrieve such an 'ununiformly distributed' data, it is needed to provide a system that helps users to grasp spatio-temporal distribution of sensor data. In this paper, we propose and implement a novel system that visualizes spatio-temporal distribution of sensor data in order to make it easier to retrieve mobile sensor data. Our system divides a map interface into grids and overlays a 2-dimensional histogram which shows the spatial distribution of the number of sensor data. The system also provides the temporal distribution of sensor data which are currently shown in the map interface. These functions enable users to grasp spatio-temporal distribution of sensor data and makes it easier to retrieve sensor data.","PeriodicalId":140194,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134119863","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}
引用次数: 4
Improvement of Pk-Anonymization pk匿名化的改进
Miho Kakizawa, Chiemi Watanabe, Ryo Furukawa, Tsubasa Takahashi
{"title":"Improvement of Pk-Anonymization","authors":"Miho Kakizawa, Chiemi Watanabe, Ryo Furukawa, Tsubasa Takahashi","doi":"10.1109/SRDSW.2014.28","DOIUrl":"https://doi.org/10.1109/SRDSW.2014.28","url":null,"abstract":"Pk-anonymization is a data anonymization method that employs randomization. Pk-anonymization guarantees Pk-anonymity, which is an extension of probabilistic k-anonymity. To implement this method, we assign random noise to records to reduce the probability of identifying record owners to less than 1/k. Existing methods assign noise using a Laplace distribution, and determine the variance of the Laplace distribution at a desired value of k to satisfy Pk-anonymity. In this paper, we propose an algorithm that improves the implementation of Pk-anonymization with smaller variance. We demonstrate the advantage of the proposed method by comparing it with an existing method.","PeriodicalId":140194,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132772635","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}
引用次数: 2
Energy Efficient Storage Management Cooperated with Data Intensive Applications in Virtual Machines 高能效存储管理与虚拟机中的数据密集型应用相结合
Shunsuke Yagai, Saneyasu Yamaguchi
{"title":"Energy Efficient Storage Management Cooperated with Data Intensive Applications in Virtual Machines","authors":"Shunsuke Yagai, Saneyasu Yamaguchi","doi":"10.1109/SRDSW.2014.24","DOIUrl":"https://doi.org/10.1109/SRDSW.2014.24","url":null,"abstract":"In data centers, huge amount of computes are running. These computes consume enormous energy. For this issue, an energy efficient storage management method cooperated with data intensive applications was proposed. With this method, data and storage devices are managed with application supports and power consumption of storage devices is significantly decreased. However, the work does not take account of virtualized environment. Recently, many data intensive applications run on virtualized environment, such as cloud computing environment. Thus, we think discussion on power effective storage management in virtualized environment is also important in addition to this work. In this paper, we focus on virtualized environment in which plural virtual machines run on a physical computer and a data intensive application runs on each virtual machine. We apply this storage management method for this environment, and evaluate performance and power consumption. Then, we proposed two storage placing methods, which are symmetric placing and asymmetric placing, for virtualized environment. Our experiments demonstrated that the proposed methods could create long HDD access intervals enough to save power consumption of storage devices. In addition, our results showed that asymmetric method could better performance than symmetric method.","PeriodicalId":140194,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126794970","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}
引用次数: 2
Optimizing Concurrent Query Execution on Modern Multisocket Multicore Platform 现代多套接字多核平台上并发查询执行优化
Fang Xi, T. Mishima, H. Yokota
{"title":"Optimizing Concurrent Query Execution on Modern Multisocket Multicore Platform","authors":"Fang Xi, T. Mishima, H. Yokota","doi":"10.1109/SRDSW.2014.25","DOIUrl":"https://doi.org/10.1109/SRDSW.2014.25","url":null,"abstract":"The upcoming generation of computer hardware brought several new challenges for underling software. The number of cores on a chip grows exponentially, allowing for an ever-increasing number of processes to execute in parallel. Therefore, how to efficiently utilize all of the concurrent processing ability provided by multi-core platform becomes critical for achieving good system performances. We propose a CARIC-DA framework which optimizes the performance of DBMS on multicore platforms. Our middleware can improve the performance of the private cache levels by dispatching concurrent database queries to run on different processor cores according to the data needs of each query. Extensive experiments from microbenchmark to TPC-C benchmark have confirmed the effectiveness of CARIC-DA in improving the cache performance and providing higher throughput for DBMSs on modern AMD multicore platform. However, the multicore platforms are becoming more and more diverse and complex in recent years. Different manufactures are making different efforts to boost their performance by adopting different techniques. Therefore, it is important for software to be well turned according to the specific hardware features in order to fully take advantage of the target multicore platforms. In this paper, we analyzed the efficiency of our CARIC-DA framework on the modern multicore Intel platform. We compared the performance of different deployment strategies where we vary the mapping relationship between database processes and processor cores from Hyper-Threading enable to disable configurations. We evaluated the impact of CARIC-DA for different cache levels and for different query types on the Intel multicore platform.","PeriodicalId":140194,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123409389","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}
引用次数: 2
A k-Anonymization Algorithm on Social Network Data that Reduces Distances between Nodes 减少节点间距离的社交网络数据k-匿名化算法
Rina Okada, Chiemi Watanabe, H. Kitagawa
{"title":"A k-Anonymization Algorithm on Social Network Data that Reduces Distances between Nodes","authors":"Rina Okada, Chiemi Watanabe, H. Kitagawa","doi":"10.1109/SRDSW.2014.19","DOIUrl":"https://doi.org/10.1109/SRDSW.2014.19","url":null,"abstract":"To provide social network data (SN) data to researchers for data analysis, protecting user privacy via anonymization is necessary. One anonymization metric for SN data called k-neighbor focuses on the neighborhood subgraphs, which, for each node, consists of the node's neighbor nodes. This metric ensures that the neighborhood subgraph of every node in the anonymized graph is isomorphic to at least k other neighborhood subgraphs, however, the existing algorithm to realize k-neighbor does not consider case that adding noise edges for anonymization may drastically change the distances of some pairs of nodes, which in turn may alter the structure of the original graph. To solve this problem, we propose an algorithm that focuses on a method to add noise edges such that the change of the distances of the pairs of nodes is suppressed. Through our experiments, we have confirmed that our algorithm maintains the given distances between nodes in the anonymized graph.","PeriodicalId":140194,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130370655","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}
引用次数: 8
A Preference Extraction Method Using Installed Applications and Their Descriptions 一种使用已安装应用程序及其描述的偏好提取方法
S. Mizuno, Jun Osawa, T. Hara, S. Nishio
{"title":"A Preference Extraction Method Using Installed Applications and Their Descriptions","authors":"S. Mizuno, Jun Osawa, T. Hara, S. Nishio","doi":"10.1109/SRDSW.2014.12","DOIUrl":"https://doi.org/10.1109/SRDSW.2014.12","url":null,"abstract":"As personalization technologies are widely used, preference extraction is becoming important. In this work, we propose a preference extraction method on the basis of applications that are installed on a user's smart device. In this method, keywords are extracted from descriptions of the installed applications on an application market. Then, each keyword is scored by three scoring criteria: degree of characteristic of the keyword in the description, scarcity and usage time of the application. As a result, the user's preference is expressed in the form of a list of pairs of a word and its importance score. From the experimental result, we confirmed that the installed applications are useful as an information source for user preference extraction. We also examined the effectiveness of each of the scoring criteria. From the result, we found that the criterion that represents scarcity of the application is effective for users installing a large number of applications. On the other hand, the criterion that represents usage time of the application tends to be effective for users using their device for a long time.","PeriodicalId":140194,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130191091","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}
引用次数: 2
Adaptive Erasure Correction Coding for Energy Efficient Dependable Storage Systems 节能可靠存储系统的自适应纠删编码
Kousuke Ota, Viet Ta Hong, H. Kaneko
{"title":"Adaptive Erasure Correction Coding for Energy Efficient Dependable Storage Systems","authors":"Kousuke Ota, Viet Ta Hong, H. Kaneko","doi":"10.1109/SRDSW.2014.13","DOIUrl":"https://doi.org/10.1109/SRDSW.2014.13","url":null,"abstract":"Erasure correction coding is an effective technique to improve the dependability of distributed storage systems and disk arrays, in which codeword symbols are distributed over multiple storage elements (SEs), e.g., storage nodes and disk drives. One of the major drawbacks of such storage systems is increased data update cost, that is, data update in one SE induces simultaneous multiple update accesses to a specified set of SEs to keep consistency of codewords. The SEs sometimes have high access cost due to, for example, large delay caused by access collision with other workloads, temporary network cutoff, and malicious attack, and high energy consumption caused by resume operations from power suspension mode. This paper proposes an adaptive coding and data allocation method which can reduce the number of update accesses to SEs having high access cost. The proposed method is based on adaptive allocation of codeword symbols of Reed-Solomon code with conditional overwrites of check symbols, and also on background relocation of codeword symbols. Preliminary simulation results show that the proposed method provides sufficiently low data loss probability with reduced energy consumption compared to RAID-1 and -6.","PeriodicalId":140194,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131389751","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
Real-Time-Aware Embedded DSMS Applicable to Advanced Driver Assistance Systems 适用于高级驾驶辅助系统的实时感知嵌入式DSMS
S. Katsunuma, S. Honda, Kenya Sato, Yousuke Watanabe, Y. Nakamoto, H. Takada
{"title":"Real-Time-Aware Embedded DSMS Applicable to Advanced Driver Assistance Systems","authors":"S. Katsunuma, S. Honda, Kenya Sato, Yousuke Watanabe, Y. Nakamoto, H. Takada","doi":"10.1109/SRDSW.2014.20","DOIUrl":"https://doi.org/10.1109/SRDSW.2014.20","url":null,"abstract":"Automotive embedded systems are composed of many kinds of sensors, and it is becoming difficult to manage these data. Therefore, we define a vehicle data processing by a Stream Processing Description (SPD), which is the data processing description used in the Data Stream Management Systems (DSMS). However, because existing DSMSs run on generalpurpose systems, it is difficult to deploy DSMSs in automotive embedded systems and fulfill these performance requirements. The DSMS for automotive embedded systems (eDSMS) generates an optimized runtime from the queries defined by an SPD not dynamically (in execution) but statically (in development), which reduces the ROM/RAM usage. In this study, we extend eDSMS for real-time processing and show the extended eDSMS is applicable to the Advanced Driver Assistance Systems (ADAS).","PeriodicalId":140194,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134569438","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}
引用次数: 7
An Approach to Dynamically Adapting Distributed System Architecture 一种动态适应分布式系统架构的方法
Jingtao Sun, I. Satoh
{"title":"An Approach to Dynamically Adapting Distributed System Architecture","authors":"Jingtao Sun, I. Satoh","doi":"10.1109/SRDSW.2014.22","DOIUrl":"https://doi.org/10.1109/SRDSW.2014.22","url":null,"abstract":"This paper presents a novel approach to adapting distributed applications, which are running on one or more computers, to change their requirements and system structures. The key idea behind the approach is to introduce the policy-based migration of software components between computers, which components are consisted by threads, for dynamically adapting general-purpose distributed applications. e.g., when a distributed application fetching a large data set to process at remote computers, software components of application should be dynamically deployed to dependability computers, which locally have or nearby data sets. Nevertheless, it may take a lot of computer resources or time to process such requests. Furthermore, it cannot able to explicitly support any adaptation for modern distributed applications. In this paper, we accomplish this approach as middleware system, which can make a variety of adaptation approaches to be implemented naturally and effectively. This paper describes the approach and the current prototype implementation of it.","PeriodicalId":140194,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115287153","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书