2008 14th IEEE International Conference on Parallel and Distributed Systems最新文献

A Short Course on Implementing FPGA Based Digital Systems 实现基于FPGA的数字系统的短期课程

2008 14th IEEE International Conference on Parallel and Distributed Systems Pub Date : 2008-12-08 DOI: 10.1109/ICPADS.2008.58

G. Jagadeesh, S. Lam, T. Srikanthan

引用次数: 2

Orchestra: Extensible Block-Level Support for Resource and Data Sharing in Networked Storage Systems 网络存储系统中资源和数据共享的可扩展块级支持

2008 14th IEEE International Conference on Parallel and Distributed Systems Pub Date : 2008-12-08 DOI: 10.1109/ICPADS.2008.110

Michail Flouris, Renaud Lachaize, A. Bilas

{"title":"Orchestra: Extensible Block-Level Support for Resource and Data Sharing in Networked Storage Systems","authors":"Michail Flouris, Renaud Lachaize, A. Bilas","doi":"10.1109/ICPADS.2008.110","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.110","url":null,"abstract":"High-performance storage systems are evolving towards decentralized commodity clusters that can scale in capacity, processing power, and network throughput. Building such systems requires: (a)Sharing physical resources among applications; (b)Sharing data among applications; (c) Allowing customized views of data for applications. Current solutions satisfy typically the first two requirements through a distributed file-system, resulting in monolithic, hard-to-manage storage systems. In this paper, we present Orchestra, a novel storage system that addresses all three above requirements below the file-system by extending the block layer. To provide customized views, Orchestra allows applications to create semantically-rich virtual block devices by combining simpler ones. To achieve efficient resource and data sharing it supports block-level allocation and byte-range locking as in-band mechanisms. We implement Orchestra under Linux and use it to build a shared cluster file-system. We evaluate it on a 16-node cluster, finding that the flexibility offered by Orchestra introduces little overhead beyond mandatory communication and disk access costs.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125422816","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

A Purpose-Based Synchronization Protocol of Multiple Transactions 基于目的的多事务同步协议

2008 14th IEEE International Conference on Parallel and Distributed Systems Pub Date : 2008-12-08 DOI: 10.1109/ICPADS.2008.56

T. Enokido, M. Takizawa

{"title":"A Purpose-Based Synchronization Protocol of Multiple Transactions","authors":"T. Enokido, M. Takizawa","doi":"10.1109/ICPADS.2008.56","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.56","url":null,"abstract":"In a peer-to-peer (P2P) system, multiple peer processes issue transactions to manipulate objects. A transaction issued by a process is assigned with a subfamily of roles named purpose, which are granted to the process. If a transaction reads an object o1 and then writes another object o2, information in o1 might flow into o2. Suppose a transaction T1 with a purpose R1 precedes another transaction T2 with a purpose R2 in a schedule. Here, if the legal information flow relation R1 ¿ R2 holds, no illegal information flow occur. Otherwise, illegal information flow might occur. In order to prevent illegal information flow, if T1 writes an object o, the object o is marked with the purpose R1. The transaction T2 is allowed to read the object o if R1 ¿ R2. Even if T1 commits, the object o isstill marked with the purpose R1. Hence, every transaction T3 with such a purpose R3 that R1 does not legally flow into R3 is aborted if T3 reads the object o. In result, the throughput is degraded. In this paper, we discuss how to release purpose marks on objects. Objects whose information may flow into an object o are source objects of o. If the source objects are changed, a purpose mark on the object o is released. In addition, an object o might have some lifetime when o's data has to be secure since the data iscreated. If it takes time since the object o is marked, the purpose mark is released. While there occur no illegal information flow in our purpose marking (PM) protocol, transactions which imply illegal information flow are aborted. We evaluate the PM protocol in terms of how many transactions are aborted.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126862587","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}

引用次数: 5

Optimal Placement of Pipeline Applications on Grid 网格上管道应用的优化布局

2008 14th IEEE International Conference on Parallel and Distributed Systems Pub Date : 2008-12-08 DOI: 10.1109/ICPADS.2008.21

S. Ngamsuriyaroj, E. Kijsipongse

{"title":"Optimal Placement of Pipeline Applications on Grid","authors":"S. Ngamsuriyaroj, E. Kijsipongse","doi":"10.1109/ICPADS.2008.21","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.21","url":null,"abstract":"Computation and communication intensive applications such as scientific data analysis and data visualization are commonly found in grid computing environment.These applications can be divided into a sequence of pipeline stages which could be executed concurrently on different grid resources to achieve high performance. Finding the optimal placement of pipeline stages on grid is a difficult problem due to the aggregation of computation and communication cost involved. This paper proposes a solution to such problem that allows the maximum application throughput by the integration of pipeline placement and data routing. The proposed solution, on one hand, minimizes the computation bottleneck of a pipeline and, on the other hand, prevents the communication cost between successive stages from dominating the entire processing time. Our proposed solution consists of two novel methods. The first method is the single path pipeline execution that fully exploits temporal parallelism and the second method is the multipath pipeline execution which can leverage both temporal and spatial parallelism inherent in any pipeline applications. We evaluate our proposed methods using a set of experiments running in a real grid environment. When compared with the results from several traditional placement methods, our proposed methods give the highest throughput.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114932730","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

CSLive: A Live Streaming Overlay with Cooperative Swarming CSLive:带有协作蜂群的实时流覆盖

2008 14th IEEE International Conference on Parallel and Distributed Systems Pub Date : 2008-12-08 DOI: 10.1109/ICPADS.2008.19

Yi-chun Chen, Wen-Hung Sun, Chiu-Ping Chang, C. King, Yueh-Feng Lee

引用次数: 1

Integrating Sensor Streams in pHealth Networks 集成传感器流在pHealth网络

2008 14th IEEE International Conference on Parallel and Distributed Systems Pub Date : 2008-12-08 DOI: 10.1109/ICPADS.2008.86

M. Roantree, D. McCann, N. Moyna

引用次数: 14

A Novel Network RAID Architecture with Out-of-Band Virtualization and Redundant Management 一种具有带外虚拟化和冗余管理的新型网络RAID架构

2008 14th IEEE International Conference on Parallel and Distributed Systems Pub Date : 2008-12-08 DOI: 10.1109/ICPADS.2008.94

Wenwu Na, Xiaoxuan Meng, Chengxiang Si, Jian Ke, Xudong Zhu, Qingzhong Bu, Lu Xu

引用次数: 3

MRBench: A Benchmark for MapReduce Framework MRBench: MapReduce框架的基准测试

2008 14th IEEE International Conference on Parallel and Distributed Systems Pub Date : 2008-12-08 DOI: 10.1109/ICPADS.2008.70

Kiyoung Kim, Kyungho Jeon, Hyuck Han, Shin-gyu Kim, Hyungsoo Jung, H. Yeom

引用次数: 79

Secure Embedded Systems: The Threat of Reverse Engineering 安全嵌入式系统:逆向工程的威胁

2008 14th IEEE International Conference on Parallel and Distributed Systems Pub Date : 2008-12-08 DOI: 10.1109/ICPADS.2008.126

I. Mcloughlin

{"title":"Secure Embedded Systems: The Threat of Reverse Engineering","authors":"I. Mcloughlin","doi":"10.1109/ICPADS.2008.126","DOIUrl":"https://doi.org/10.1109/ICPADS.2008.126","url":null,"abstract":"Companies releasing newly designed embedded products typically recoup the cost of development through initial sales, and thus are unlikely to welcome early competition based around rapid reverse engineering of their products. By contrast, competitors able to shorten time-to-market though reverse engineering will gain design cost and market share advantages. Reverse engineering for nefarious purposes appears to be commonplace, and has significant cost impact on industry sales and profitability. In the Embedded Systems MSc programme at Nanyang Technological University, we are aiming to raise awareness of the unique security issues related to the reverse engineering of embedded systems. This effort is largely through devoting 50% of the secure embedded systems course, ES6190 to reverse engineering (the remainder to traditional security concerns). This paper covers the reverse engineering problem scope, and our approach to raising awareness through the secure embedded systems course. A classification of hardware reverse engineering steps and mitigations is also presented for the first time, with an overview of a reverse engineering curriculum. Since the quantity of published literature related to the reverse-engineering of embedded systems lies somewhere between scarce and nonexistent, this paper presents a full overview of the topic before descussing educational aspects related to this.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128106756","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}

引用次数: 42

Improving Web Server Performance Through Main Memory Compression 通过主内存压缩提高Web服务器性能

2008 14th IEEE International Conference on Parallel and Distributed Systems Pub Date : 2008-12-08 DOI: 10.1109/icpads.2008.15

Vicencc Beltran, J. Torres, E. Ayguadé

{"title":"Improving Web Server Performance Through Main Memory Compression","authors":"Vicencc Beltran, J. Torres, E. Ayguadé","doi":"10.1109/icpads.2008.15","DOIUrl":"https://doi.org/10.1109/icpads.2008.15","url":null,"abstract":"Current Web servers are highly multithreaded applications whose scalability benefits from the current multi-core/multiprocessor trend. However, some workloads cannot capitalize on this because their performance is limited by the available memory and/or the disk bandwidth, which prevents the server from taking advantage of the computing resources provided by the system. To solve this situation we propose the use of main memory compression techniques to increment the available memory and mitigate the disk band-width problem, allowing the Web server to improve its use of CPU system resources. In this paper we implement to the Linux OS a full SMP capable main memory compression subsystem to increase the performance of a Web server running the SPEC Web 2005 benchmark. Although main memory compression is not a new technique per-se, its use in a multicore environment running heavily multithreaded applications like a Web server introduces new challenges in the technique, such as scalability issues and the trade-off between the compressed memory size and the computational power required to achieve it. Finally, the evaluation of our implementation shows promising results such as a 30% Web server throughput improvement and a 70% reduction in the disk bandwidth usage.","PeriodicalId":165558,"journal":{"name":"2008 14th IEEE International Conference on Parallel and Distributed Systems","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125795914","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}

引用次数: 20