F. Desprez, George S. Markomanolis, M. Quinson, F. Suter
{"title":"Assessing the Performance of MPI Applications through Time-Independent Trace Replay","authors":"F. Desprez, George S. Markomanolis, M. Quinson, F. Suter","doi":"10.1109/ICPPW.2011.33","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.33","url":null,"abstract":"Simulation is a popular approach to obtain objective performance indicators platforms that are not at one's disposal. It may help the dimensioning of compute clusters in large computing centers. In this work we present a framework for the off-line simulation of MPI applications. Its main originality with regard to the literature is to rely on time-independent execution traces. This allows us to completely decouple the acquisition process from the actual replay of the traces in a simulation context. Then we are able to acquire traces for large application instances without being limited to an execution on a single compute cluster. Finally our framework is built on top of a scalable, fast, and validated simulation kernel. In this paper, we introduce the used time-independent trace format, investigate several acquisition strategies, detail the developed trace replay tool, and assess the quality of our simulation framework in terms of accuracy, acquisition time, simulation time, and trace size.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132212832","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}
H. Nguyen, D. Abramson, B. Bethwaite, M. N. Dinh, C. Enticott, S. Garic, A. Russel, Stephen Firth, I. Harper, M. Lackmann, Mary Vail, Stefan Schek
{"title":"Integrating Scientific Workflows and Large Tiled Display Walls: Bridging the Visualization Divide","authors":"H. Nguyen, D. Abramson, B. Bethwaite, M. N. Dinh, C. Enticott, S. Garic, A. Russel, Stephen Firth, I. Harper, M. Lackmann, Mary Vail, Stefan Schek","doi":"10.1109/ICPPW.2011.30","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.30","url":null,"abstract":"Modern in-silico science (or e-Science) is a complex process, often involving multiple steps conducted across different computing environments. Scientific workflow tools help scientists automate, manage and execute these steps, providing a robust and repeatable research environment. Increasingly workflows generate data sets that require scientific visualization, using a range of display devices such as local workstations, immersive 3D caves and large display walls. Traditionally, this display step handled outside the workflow, and output files are manually copied to a suitable visualization engine for display. This inhibits the scientific discovery process disconnecting the workflow that generated the data from the display and interpretation processes. In this paper we present a solution that links scientific workflows with a variety of display devises, including large tiled display walls. We demonstrate the feasibility of the system by a prototype implementation that leverages the Kepler workflow engine and the SAGE display software. We illustrate the use of the system with a case study in workflow driven microscopy.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116127712","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}
G. R. Watson, W. Frings, Claudia Knobloch, Carsten Karbach, Albert L. Rossi
{"title":"Scalable Control and Monitoring of Supercomputer Applications Using an Integrated Tool Framework","authors":"G. R. Watson, W. Frings, Claudia Knobloch, Carsten Karbach, Albert L. Rossi","doi":"10.1109/ICPPW.2011.53","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.53","url":null,"abstract":"Recently, a new generation of significantly more powerful petascale systems has become available to the scientific computing community. The vast power of these systems, coupled with a corresponding increase in application code complexity, is now making the limitations of existing programming and performance tools ever more apparent. If developers are going to be able to effectively utilize these systems, then a new generation of exemplary tools will be required. The Parallel Tools Platform (PTP) Project was established in 2005 to create a best-practice integrated tool workbench designed to increase the productivity of parallel application development. PTP has increased in popularity over the years, and is now used by a growing community of developers in scientific and engineering fields, however, PTP also faces some challenges in adapting to the new petascale environments. In this paper we describe some of the recent changes to PTP core infrastructure that will enable it to work effectively with these and future generations of high performance computing systems.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123487193","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":"Handling the Backhaul Link Failure for IEEE 802.16m Femto ABSs","authors":"Yu-Chan Lin, Whai-En Chen, Meng-Hsuan Lin","doi":"10.1109/ICPPW.2011.21","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.21","url":null,"abstract":"A Fem to Advanced Base Station (ABS) is a low-power base station and used to extend Worldwide Interoperability for Microwave Access (WiMAX) coverage to the indoor areas. The Fem to ABS utilizes broadband connection (e.g., cable or DSL) as its backhaul link to connect to the mobile operator¡¦s network and Internet. However, the broadband connection is less reliable than the dedicate line. In other words, the Fem to ABS has more backhaul failure probability than the Macro ABS which uses the dedicate line. In order to reduce the impact of backhaul link failure, this paper proposes two mechanisms to handle the backhaul link failure based on different interfaces defined in IEEE 802.16m. This paper then compares these mechanisms in terms of the additional interface requirement, the notification method, the authentication/key exchange and the re-registration requirement. This paper also develops an analytic model to study the disruption time and packet loss of the proposed mechanisms.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129573253","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}
Chi-Bang Kuan, Jia-Jhe Li, Chung-Kai Chen, Jenq-Kuen Lee
{"title":"C++ Compiler Supports for Embedded Multicore DSP Systems","authors":"Chi-Bang Kuan, Jia-Jhe Li, Chung-Kai Chen, Jenq-Kuen Lee","doi":"10.1109/ICPPW.2011.38","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.38","url":null,"abstract":"The development of embedded systems has moved toward multicore in recent years. As processor numbers continue growing in embedded multicore systems, how to provide efficient programming models and tailored compiler supports becomes a critical issue in developing embedded multicore applications. Though C still dominates embedded computing so far, C++ is gaining importance and popularity in DSP systems for its power and flexibility. In addition, current C++ compilers are able to produce efficient and compact code as C compilers. This increases the practical use of C++ technologies in embedded systems. In this paper, we address issues in supporting C++ compilers and present methods to leverage C++ in embedded multicore computing. Since embedded systems are usually limited by tight resource, code size issues are addressed when supporting C++ libraries. Code size of standard C++ library is analyzed and a library layering technique is provided to guide reasonable library use in embedded applications. Our methods to leverage C++ include enhancing programming models with high-level abstraction and incorporating the programming models with parallel patterns to simplify program parallelization. In our experiments, PAC multi-DSP systems, composed of one MPU and two VLIW DSPs, are used to evaluate the proposed methods. Parallelization results on stereo-vision and image-blurring applications are presented with key components of the systems, including SIMD and DMAs, incorporated to pursue maximal performance. The result shows our approaches with C++ compilers can deliver performance improvements of 61% and 174% for the stereo-vision and image-blurring applications, respectively.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124007994","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}
Arthur Rahumed, Henry C. H. Chen, Yangyi Tang, P. Lee, John C.S. Lui
{"title":"A Secure Cloud Backup System with Assured Deletion and Version Control","authors":"Arthur Rahumed, Henry C. H. Chen, Yangyi Tang, P. Lee, John C.S. Lui","doi":"10.1109/ICPPW.2011.17","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.17","url":null,"abstract":"Cloud storage is an emerging service model that enables individuals and enterprises to outsource the storage of data backups to remote cloud providers at a low cost. However, cloud clients must enforce security guarantees of their outsourced data backups. We present Fade Version, a secure cloud backup system that serves as a security layer on top of today's cloud storage services. Fade Version follows the standard version-controlled backup design, which eliminates the storage of redundant data across different versions of backups. On top of this, Fade Version applies cryptographic protection to data backups. Specifically, it enables fine-grained assured deletion, that is, cloud clients can assuredly delete particular backup versions or files on the cloud and make them permanently inaccessible to anyone, while other versions that share the common data of the deleted versions or files will remain unaffected. We implement a proof-of-concept prototype of Fade Version and conduct empirical evaluation atop Amazon S3. We show that Fade Version only adds minimal performance overhead over a traditional cloud backup service that does not support assured deletion.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121436426","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}
Yaun-Chou Cheng, Ju-Yi Lin, Chih-Wei Yi, Y. Tseng, Lun-Chia Kuo, Yu-Jung Yeh, Chung-Wei Lin
{"title":"AR-Based Positioning for Mobile Devices","authors":"Yaun-Chou Cheng, Ju-Yi Lin, Chih-Wei Yi, Y. Tseng, Lun-Chia Kuo, Yu-Jung Yeh, Chung-Wei Lin","doi":"10.1109/ICPPW.2011.48","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.48","url":null,"abstract":"Augmented Reality (AR) that can be considered as a form of location-based services is a technique utilizing position and orientation information and a location database of POIs to enrich video or photographs by adding on graphics or text objects. The AR technique can be used to develop Pedestrian Navigation Systems (PNSs), but high-precision positioning is needed for displaying AR objects at proper places. However, the required level of accuracy is far beyond current commercial positioning solutions, e.g., outdoor GPS and indoor RF systems. In this paper, we propose an AR-based positioning technique for AR users to position their locations. First, by utilizing a coarse positioning system, AR objects can be roughly displayed on the touch screen of a AR device. Then, AR objects can be matched with their images on the display via drag-and-drop operations by users. Thus, both the coordinates of the AR objects in the image and in the real world can be known. Based on the coordinates along with the knowledge of the camera focal length, the location at which the photograph was taken can be known. The location of the camera can be treated as the location of the user. The proposed positioning technique is very helpful in developing high-precision PNSs.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129644267","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":"A Runtime Partitioning Technique for Mobile Web Services","authors":"M. Asif, S. Majumdar","doi":"10.1109/ICPPW.2011.47","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.47","url":null,"abstract":"Web service (WS) technology has established itself as a key component of enterprise computing for a number of business processes. The mobile devices are expected to become primary internet devices in the near future. The popularity of mobile devices and establishment of WS technology has increased the demand of accessing and hosting web services on mobile devices. Hosting web services on such devices is always challenging because of their limited resources. In this paper, we propose a run time WS partitioning technique with the objective of improving the overall system performance. The proposed WS partitioning technique is devised to offload different sizes of partition on a remote computing node based on the system load. Performance of the proposed WS partitioning technique is analyzed by performing experiments on a simulator.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124133733","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":"Can MPI Benefit Hadoop and MapReduce Applications?","authors":"Xiaoyi Lu, Bing Wang, L. Zha, Zhiwei Xu","doi":"10.1109/ICPPW.2011.56","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.56","url":null,"abstract":"The Message Passing Interface (MPI) standard and its implementations (such as MPICH and OpenMPI) have been widely used in the high-performance computing area to provide an efficient communication infrastructure. This paper investigates whether MPI can be adapted to the data intensive computing area to substantially speed up Hadoop and MapReduce applications, by reducing communication overheads. Three specific issues are studied. First, is the potential for reducing communication overheads significant, if MPI is used? Second, what are the main technical challenges to adapt MPI to Hadoop? Third, what are the minimal extensions to the MPI standard that can help alleviate the challenges while promise to significantly improve performance? To answer the first question, we identify important and basic communication primitives in both MPI and Hadoop, and make fair comparisons of their performance through experiments. The results show that the potential for improvement could be high. To answer the second and the third questions, we analyze the Hadoop code base to identify communication related programmers' needs. Furthermore, we propose a minimal interface extension to the MPI standard (only one pair of library calls are added), which capture the key-value pair nature commonly found in data intensive computing. This extension is implemented in a prototype library called MPI-D. Benchmark tests based on simulation show that Hadoop augmented with MPI-D could significantly speed up MapReduce application performance.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115492875","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":"Channel-Aware Slot Assignment by Ant Colony in OFDMA-Based Mobile WiMAX Networks","authors":"I. Hwang, Chien-Yao Chiu, B. Hwang","doi":"10.1109/ICPPW.2011.36","DOIUrl":"https://doi.org/10.1109/ICPPW.2011.36","url":null,"abstract":"In this paper, a novel adaptive ant colony slot assignment (ACSA) algorithm including construct solution and pheromone update is proposed to assign OFDMA-based radio resource. The aim of ACSA is to achieve high bandwidth efficiency on the basis of specific channel conditions while guaranteeing the QoS requirements. Performance comparisons with the rate-guaranteed competitive scheduling (RCS) are presented in terms of delay, jitter, packet dropping rate, throughput and waste to highlight the better behavior of our proposed schemes.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122371580","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}