发布求助
文献互助 智能选刊 最新文献

2013 International Conference on Parallel and Distributed Systems最新文献

筛选
英文 中文
Utilizing Human Intelligence in a Crowdsourcing Marketplace for Big Data Processing 在众包市场中利用人类智能进行大数据处理
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.113
Sivadon Chaisiri
{"title":"Utilizing Human Intelligence in a Crowdsourcing Marketplace for Big Data Processing","authors":"Sivadon Chaisiri","doi":"10.1109/ICPADS.2013.113","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.113","url":null,"abstract":"Crowd sourcing emerging as a distributed problem-solving model can dispatch tasks to a large number of human workers. The workers' human intelligence can be utilized to execute tasks which cannot be efficiently performed by computer-based systems. A crowd sourcing environment supports various data processing tasks, for example, data collection, data annotation, data validation, data classification, and natural language processing. In particular, the crowd sourcing environment can be applied for big data processing as well. In this paper, we propose Human-Intelligence-as-a-Service (HIaaS) which is a cloud computing service model utilizing human intelligence in a crowd sourcing marketplace to process big data. We also propose an optimization model based on stochastic programming for provisioning human workers in a HIaaS-based marketplace. Numerical studies are performed to evaluate the optimization model. A video rating system handling a big data set is an illustrative example analyzed in the studies. The results show that the model can efficiently reduce the cost to provision workers for processing a big data job.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122320486","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
Data Transfer Matters for GPU Computing GPU计算的数据传输问题
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.47
Yusuke Fujii, Takuya Azumi, N. Nishio, S. Kato, M. Edahiro
{"title":"Data Transfer Matters for GPU Computing","authors":"Yusuke Fujii, Takuya Azumi, N. Nishio, S. Kato, M. Edahiro","doi":"10.1109/ICPADS.2013.47","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.47","url":null,"abstract":"Graphics processing units (GPUs) embrace many-core compute devices where massively parallel compute threads are offloaded from CPUs. This heterogeneous nature of GPU computing raises non-trivial data transfer problems especially against latency-critical real-time systems. However even the basic characteristics of data transfers associated with GPU computing are not well studied in the literature. In this paper, we investigate and characterize currently-achievable data transfer methods of cutting-edge GPU technology. We implement these methods using open-source software to compare their performance and latency for real-world systems. Our experimental results show that the hardware-assisted direct memory access (DMA) and the I/O read-and-write access methods are usually the most effective, while on-chip micro controllers inside the GPU are useful in terms of reducing the data transfer latency for concurrent multiple data streams. We also disclose that CPU priorities can protect the performance of GPU data transfers.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124448669","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}
引用次数: 74
Hardware Implementation of Math Module Based on CORDIC Algorithm Using FPGA 基于CORDIC算法的数学模块的FPGA硬件实现
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/.111
M. Ibrahim, Chen Kean Tack, M. Idroas, Siti Noormaya Bilmas, Zuraimi Yahya
{"title":"Hardware Implementation of Math Module Based on CORDIC Algorithm Using FPGA","authors":"M. Ibrahim, Chen Kean Tack, M. Idroas, Siti Noormaya Bilmas, Zuraimi Yahya","doi":"10.1109/.111","DOIUrl":"https://doi.org/10.1109/.111","url":null,"abstract":"This paper discusses the implementation of math hardware module based on CORDIC algorithm to solve trigonometry, hyperbolic and exponential function on FPGA. CORDIC is one of the hardware efficient and iteration based algorithms that is used to implement various transcendental functions such as trigonometry, hyperbolic, exponential and so forth. In addition, by using this algorithm, the hardware requirement and cost are less as only shift registers, adders and ROM are required. Thus, the design is implemented on FPGA since it provides a versatile and inexpensive way for implementation. The design is then further interfaced with 4x4 matrix keypad and 16x2 character LCD to build a simple math hardware module for real time application. The coding of algorithm was written in Verilog HDL and the verification is done firstly by using simulation results of the ModelSim and then using the implementation on Alter a DE1 board with the design interfaced with keypad and LCD to display the results.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121075164","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
Achieving TeraCUPS on Longest Common Subsequence Problem Using GPGPUs 利用gpgpu实现TeraCUPS的最长公共子序列问题
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.22
Adnan Ozsoy, A. Chauhan, D. M. Swany
{"title":"Achieving TeraCUPS on Longest Common Subsequence Problem Using GPGPUs","authors":"Adnan Ozsoy, A. Chauhan, D. M. Swany","doi":"10.1109/ICPADS.2013.22","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.22","url":null,"abstract":"In this paper, we describe a novel technique to optimize longest common subsequence (LCS) algorithm for one-to-many matching problem on GPUs by transforming the computation into bit-wise operations and a post-processing step. The former can be highly optimized and achieves more than a trillion operations (cell updates) per second (CUPS)-a first for LCS algorithms. The latter is more efficiently done on CPUs, in a fraction of the bit-wise computation time. The bit-wise step promises to be a foundational step and a fundamentally new approach to developing algorithms for increasingly popular heterogeneous environments that could dramatically increase the applicability of hybrid CPU-GPU environments.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125565366","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
Strong Dynamic Consensus in Byzantine Faulty Systems with Churn 具有扰动的拜占庭故障系统的强动态一致性
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.53
A. Klappenecker, Hyunyoung Lee
{"title":"Strong Dynamic Consensus in Byzantine Faulty Systems with Churn","authors":"A. Klappenecker, Hyunyoung Lee","doi":"10.1109/ICPADS.2013.53","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.53","url":null,"abstract":"Dynamic distributed systems allow processes to join and leave the system, so the number of processes participating in a computation varies over time. Examples of dynamic distributed systems include peer-to-peer networks, sensor networks, mobile ad-hoc networks, and many more. A fundamental problem in any distributed system is to find consensus among the processes on a common input value. For dynamic distributed systems, it is not entirely clear how the problem should be formulated, as processes can join and leave before consensus is reached. We formulate and solve a strong version of the consensus problem in dynamic distributed systems in the presence of Byzantine faulty processes. We show that one cannot improve upon our algorithm in terms of the bound on the number of processes. For stochastic dynamic distributed systems, we determine the probability that a set of processes can reach strong consensus.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129248529","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
OpenCL-Based Remote Offloading Framework for Trusted Mobile Cloud Computing 基于opencl的可信移动云计算远程卸载框架
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.43
Heungsik Eom, P. S. Juste, R. Figueiredo, Omesh Tickoo, R. Illikkal, R. Iyer
{"title":"OpenCL-Based Remote Offloading Framework for Trusted Mobile Cloud Computing","authors":"Heungsik Eom, P. S. Juste, R. Figueiredo, Omesh Tickoo, R. Illikkal, R. Iyer","doi":"10.1109/ICPADS.2013.43","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.43","url":null,"abstract":"OpenCL has emerged as the open standard for parallel programming for heterogeneous platforms enabling a uniform framework to discover, program, and distribute parallel workloads to the diverse set of compute units in the hardware. For that reason, there have been efforts exploring the advantages of parallelism from the OpenCL framework by offloading GPGPU workloads within an HPC cluster environment. In this paper, we present an OpenCL-based remote offloading framework designed for mobile platforms by shifting the motivation and advantages of using the OpenCL framework for the HPC cluster environment into mobile cloud computing where OpenCL workloads can be exported from a mobile node to the cloud. Furthermore, our offloading framework handles service discovery, access control, and data privacy by building the framework on top of a social peer-to-peer virtual private network, Social VPN. We developed a prototype implementation and deployed it into local- and wide-area environments to evaluate the performance improvement and energy implications of the proposed offloading framework. Our results show that, depending on the complexity of the workload and the amount of data transfer, the proposed architecture can achieve more energy efficient performance by offloading than executing locally.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124542737","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}
引用次数: 13
Cloud Services Aided E-Tourism: In the Case of Low-Cost Airlines for Backpacking 云服务辅助电子旅游:以低成本航空公司的背包客为例
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.85
J. C. Hung, R. Zhou, Jun Hu, Huaming Chen, Qingguo Zhou, Ji Qi, Lei Yang
{"title":"Cloud Services Aided E-Tourism: In the Case of Low-Cost Airlines for Backpacking","authors":"J. C. Hung, R. Zhou, Jun Hu, Huaming Chen, Qingguo Zhou, Ji Qi, Lei Yang","doi":"10.1109/ICPADS.2013.85","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.85","url":null,"abstract":"The emergence of Cloud Services and Mobile Internet has influenced the society a lot, including the tourism industry. This paper proposes a design of backpacking service, not only aimed at the travelling routines, but also focus on the low-cost airlines. This kind of service aids backpackers with an effective travelling and satisfy the price requirement. With this low-cost airlines system, the backpackers can experience real e-Tourism and enjoy a better travel aided by the real-time information. According to the basic principles of low-cost airlines, this paper provides the backpackers with a definitely efficient way to check out a suitable flight itinerary under an acceptable price.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121097876","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
Benchmarking Large Scale Cloud Computing in Asia Pacific 亚太地区大规模云计算基准测试
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/.122
A. Sabri, S. R. Balakrishnan, Sun Veer Moolye, Chung Yik Cho, S. K. Dhillon, A. Sidhu
{"title":"Benchmarking Large Scale Cloud Computing in Asia Pacific","authors":"A. Sabri, S. R. Balakrishnan, Sun Veer Moolye, Chung Yik Cho, S. K. Dhillon, A. Sidhu","doi":"10.1109/.122","DOIUrl":"https://doi.org/10.1109/.122","url":null,"abstract":"Cloud services allows organizations to run their applications faster, under better manageability and less maintenance so that they can focus on their core business. In this paper we are benchmarking various public clouds (Microsoft Azure, Amazon EC2 and the Australian National eResearch Collaboration Tools and Resources Cloud (NeCTAR)) that are commonly used by academic organizations in Asia Pacific to gauge their performances using variety of tests.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121435342","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
Lightweight Management of Authorization Update on Cloud Data 云数据授权更新的轻量级管理
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.83
Zongmin Cui, Hong Zhu, Jie Shi, Lianhua Chi, Ke Yan
{"title":"Lightweight Management of Authorization Update on Cloud Data","authors":"Zongmin Cui, Hong Zhu, Jie Shi, Lianhua Chi, Ke Yan","doi":"10.1109/ICPADS.2013.83","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.83","url":null,"abstract":"While outsourcing data to cloud, security and efficiency issues should be taken into account. However, it is very challenging to design a secure and efficient mechanism supporting authorization updates. In this paper, we aim to provide a mechanism supporting authorization updates which only incurs a lightweight cost of authorization updates and meanwhile supports a high level of security. This mechanism is consisted of two encryption schemes performed in different layers. The inner-layer encryption scheme is performed on the original plaintext and the generated cipher text is called inner-layer cipher text, while a part of the inner-layer cipher text is encrypted by the outer-layer encryption scheme to generate cipher text, called out-layer cipher text. These two encryption schemes are both performed by data owner. The inner-layer encryption realizes the initial authorization policy, while the outer-layer encryption reflects the updated authorization policy. We implement the proposed mechanism and conduct extensive experiments. The experimental results demonstrate that the proposed mechanism outperforms previous existing approaches, e.g. single-layer encryption and double-layer encryption.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121514475","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
A Novel Query Tree Protocol Based on Partial Responses for RFID Tag Anti-collision 一种基于部分响应的RFID标签防碰撞查询树协议
2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.110
Ming-Kuei Yeh, Jehn-Ruey Jiang
{"title":"A Novel Query Tree Protocol Based on Partial Responses for RFID Tag Anti-collision","authors":"Ming-Kuei Yeh, Jehn-Ruey Jiang","doi":"10.1109/ICPADS.2013.110","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.110","url":null,"abstract":"In the RFID system, when two or more tags respond their IDs to the reader simultaneously, wireless signal collision occurs and no tag can be identified successfully by the reader. How to reduce such collisions in order to speed up the identification performance is thus important. There are many anti-collision protocols proposed to solve the tag collision problem. They can be categorized into two classes: ALOHA-based and tree-based protocols. The query tree (QT) protocol is a famous tree-based protocol having many advantages. It is stateless and uses no on-tag memory to keep protocol states, it is a plain protocol and uses no special techniques, such as bit-tracking, ID-revising, and re-identification. In this paper, we propose a stateless and plain tree based anti-collision protocol, called PRQT, by using tag ID partial responses to speed up tag identification. We also conduct simulation experiments for PRQT and compare it with QT in terms of the number of iterations to identify tags. As we will show, the PRQT protocol uses less numbers of iterations to identify tags than the QT protocol.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130618573","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
首页 上一页 下一页 尾页
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学术官方微信