Pablo Quesada-Barriuso, D. Heras, Francisco Argüello
{"title":"Efficient GPU Asynchronous Implementation of a Watershed Algorithm Based on Cellular Automata","authors":"Pablo Quesada-Barriuso, D. Heras, Francisco Argüello","doi":"10.1109/ISPA.2012.19","DOIUrl":"https://doi.org/10.1109/ISPA.2012.19","url":null,"abstract":"The watershed transform is a widely used method for non-supervised image segmentation, especially suitable for low-contrast images. In this paper we show that an algorithm calculating the watershed transform based on a cellular automaton is a good choice for the most recent GPU architectures, especially when the synchronization rules are relaxed. In particular we compare a synchronous and an asynchronous implementation of the algorithm. The results show high speedups for both implementations, especially for the asynchronous one, indicating the potential of this kind of algorithms for new architectures based on hundreds of cores.","PeriodicalId":324488,"journal":{"name":"2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123284954","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":"Cross-Stratum Optimization Aware Provisioning Algorithm for Cloud Data Centers","authors":"S. Tursunova, Tae-Ho Lee, N. Kodirov, T. Choi","doi":"10.1109/ISPA.2012.79","DOIUrl":"https://doi.org/10.1109/ISPA.2012.79","url":null,"abstract":"As virtualization technology matured, the concept of virtual network environment has emerged. Because of the flexibility of virtualization, the cloud computing services can serve various needs of its customers more efficiently. However, in some of virtual network provisioning algorithms decisions are made without any consideration of underlying network. In this paper, we are focusing on cross stratum optimization opportunities, e.g., combined optimization of resources in the application and network stratums, and proposing and an efficient and optimized provisioning algorithm. We propose a CSO-aware provisioning algorithm and show its benefits over traditional resource allocation.","PeriodicalId":324488,"journal":{"name":"2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123337133","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}
R. Kaewpuang, Sivadon Chaisiri, D. Niyato, Bu-Sung Lee, Ping Wang
{"title":"Adaptive Power Management for Data Center in Smart Grid Environment","authors":"R. Kaewpuang, Sivadon Chaisiri, D. Niyato, Bu-Sung Lee, Ping Wang","doi":"10.1109/ISPA.2012.24","DOIUrl":"https://doi.org/10.1109/ISPA.2012.24","url":null,"abstract":"We propose an adaptive power management (APM) algorithm for a data center with an objective to minimize the total cost of power bought from an electrical grid. This APM algorithm is developed for a smart grid environment which is envisioned to be a cooperative, responsive, and economical power system. In particular, APM algorithm takes the spot power price from an electrical grid, the power supply from a renewable power source, and users' demand in terms of application workload processing into account when managing the power consumption. Therefore, an APM algorithm is considered to be the demand side management in a smart grid. To obtain an optimal decision of the APM algorithm, an optimization model based on stochastic programming with multi-stage recourse is developed. This optimization model considers various uncertainties and is able to determine the optimal solution for the APM algorithm. The APM algorithm is evaluated by numerical studies. The numerical results clearly show that the APM algorithm can minimize the power cost of a data center.","PeriodicalId":324488,"journal":{"name":"2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116135248","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}
Phillippe Samer, Afonso H. Sampaio, Anolan Milanés, S. Urrutia
{"title":"Designing a Multicore Graph Library","authors":"Phillippe Samer, Afonso H. Sampaio, Anolan Milanés, S. Urrutia","doi":"10.1109/ISPA.2012.106","DOIUrl":"https://doi.org/10.1109/ISPA.2012.106","url":null,"abstract":"Graph Theory provides a set of powerful tools (both theorems and algorithms) for problem modeling and solving in numerous domains. Though there are several libraries implementing graph algorithms and targeting different platforms and users, few of those offer parallel implementations. To the best of our knowledge, there is a particular need for an easier to use and extend library, specifically designed to exploit the multicore architecture trend for high performance parallelism. In this paper we describe Magical, a new OpenMP-based C++ multicore graph library. Our focus is to provide an implementation of graph algorithms which is designed for multicore architectures, by means of an easy to use application programming interface. We describe the library design and evaluate its performance by means of a case study concerning a shortest-paths problem.","PeriodicalId":324488,"journal":{"name":"2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122895973","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 Graph Partitioning Approach to Distributed RDF Stores","authors":"Rui Wang, K. Chiu","doi":"10.1109/ISPA.2012.60","DOIUrl":"https://doi.org/10.1109/ISPA.2012.60","url":null,"abstract":"With growing of Semantic Web data, especially RDF data, managing large RDF dataset on a single machine does not scale well. Previous work has explored how to distribute RDF triples to multiple machines. However due to inefficient dataset partitioning used by these solutions, the performance of distributed store system is significantly affected. In this paper, we proposed a promising approach that utilized the graph nature of RDF datasets to minimize relations between partitions after dataset partitioning, and optimized system design based on it. As shown in our experiments, our approach can effectively reduce communication cost of query-processing messages, balance size of partitions compared with other approaches, and enhance parallelism through independent sub-querying.","PeriodicalId":324488,"journal":{"name":"2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122446126","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}
D. Nguyen, Francesco Lelli, M. Papazoglou, W. Heuvel
{"title":"Issue in Automatic Combination of Cloud Services","authors":"D. Nguyen, Francesco Lelli, M. Papazoglou, W. Heuvel","doi":"10.1109/ISPA.2012.71","DOIUrl":"https://doi.org/10.1109/ISPA.2012.71","url":null,"abstract":"Current cloud service description languages envision the ability to automatically combine cloud service offerings across multiple abstraction layers, i.e. software, platform, and infrastructure service offerings, to achieve a common shared business goal. However, only little effort has been spent in this direction. This paper formalizes the issue of automatic combination of cloud services showing its computationally intensive nature. In order to overcome this issue we propose a Resource Description Framework (RDF)-based prototype implementation that leverages a batch process for automatically constructing possible combinations of cloud services. Using this approach we are able to analyze possible combinations of cloud services that may fit particular customer needs in a timely fashion.","PeriodicalId":324488,"journal":{"name":"2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130635120","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":"Anomaly Detection Algorithms on IBM InfoSphere Streams: Anomaly Detection for Data in Motion","authors":"Yifat Yulevich, Alex Pyasik, L. Gorelik","doi":"10.1109/ISPA.2012.145","DOIUrl":"https://doi.org/10.1109/ISPA.2012.145","url":null,"abstract":"This paper presents and shares excerpts from our implementation of near real-time anomaly detection algorithms on the IBM InfoSphere Streams platform. The purpose of this article is to: 1) Describe how to design and implement known anomaly detection algorithms on IBM InfoSphere Streams. 2) Present some performance optimization capabilities of IBM InfoSphere Streams platform and propose a method to use them in anomaly detection applications. 3) Present some IBM InfoSphere Streams best practices and describe how their adoption in the context of anomaly detection application. The document describes the architecture and design of anomaly detection algorithms developed on IBM InfoSphere Streams. Although the solution was designed to be used for cyber security, the implemented algorithms are agnostic regarding the data type that they monitor and therefore can detect anomalies in data from various industries such as healthcare, finance and retail. The document describes the implementation of two anomaly detection algorithms: KOAD and PCA. The KOAD algorithm performs online anomaly detection with incremental learning and the PCA algorithm in performs offline anomaly detection. The solution was designed to provide near real-time insight into low latency on large data volume observation.","PeriodicalId":324488,"journal":{"name":"2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114531251","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}
Wanjun Huang, M. Tacca, Ning So, M. Razo, A. Fumagalli
{"title":"Cooperative Data Center Selection for Optimal Service Performance: An ILP Formulation","authors":"Wanjun Huang, M. Tacca, Ning So, M. Razo, A. Fumagalli","doi":"10.1109/ISPA.2012.77","DOIUrl":"https://doi.org/10.1109/ISPA.2012.77","url":null,"abstract":"Cross layer optimization is well-known to offer certain cost and performance advantages when designing and operating data networks [1]. It is reasonable to anticipate similar advantages when applying such optimizations across the network layer and the application layer too. In this paper, the authors define one optimization problem whereby the service-to-hosting data center mapping is performed taking into account the available resources in both the data center (CPU cycles) and network (bandwidth) subsystems. The objective function of the optimization problem accounts for the amount of both CPU cycles and bandwidth, which are assigned to each requested service, with the assumption that the user's Quality of Experience (QoE) strictly depends only on these two factors. The problem is formulated using ILP and its numerical results are discussed to gain insights into the potential QoE gains that might result from using this cross layer (cooperative) resource assignment technique.","PeriodicalId":324488,"journal":{"name":"2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121661086","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 Version Clocks and the OffSync Protocol","authors":"Christoph P. Neumann, A. Wahl, R. Lenz","doi":"10.1109/ISPA.2012.123","DOIUrl":"https://doi.org/10.1109/ISPA.2012.123","url":null,"abstract":"The α-OffSync project offers a synchronization concept for α-Flow, an electronic process support in heterogeneous inter-institutional scenarios in healthcare. A distributed case file is provided by α-Flow to represent workflow schemas as documents which are shared coequally to content documents. α-OffSync allows the detection and resolution of global concurrent modification conflicts on process artifacts based on locally available information by using logical timestamps. Further mechanisms are included to ease the management and dynamic extension of the group of participating actors.","PeriodicalId":324488,"journal":{"name":"2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134351872","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":"Building Network-aware Composite Services with the GEMBus Framework","authors":"P. Martinez-Julia, D. López, A. Gómez-Skarmeta","doi":"10.1109/ISPA.2012.76","DOIUrl":"https://doi.org/10.1109/ISPA.2012.76","url":null,"abstract":"The GEMBus framework is intended to provide the necessary mechanisms to build federated composite services. Thus, it can constitute a key element in achieving cross-stratum optimization by combining network-layer events with service-layer operation knowledge. Taking advantage of the unique service perspective of the high level network operations we can use the GEMBus framework to compose the services with the network elements in order to build an enhanced and network-aware service. In this paper we give a brief description of the GEMBus architecture and discuss how to use it to build such services. We also evaluate the architecture using a proof-of-concept implementation and discuss the obtained results.","PeriodicalId":324488,"journal":{"name":"2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130736914","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}