S. Kailasam, N. Gnanasambandam, D. Ram, Naveen Sharma
{"title":"Optimizing Service Level Agreements for Autonomic Cloud Bursting Schedulers","authors":"S. Kailasam, N. Gnanasambandam, D. Ram, Naveen Sharma","doi":"10.1109/ICPPW.2010.54","DOIUrl":"https://doi.org/10.1109/ICPPW.2010.54","url":null,"abstract":"The practice of computing across two or more data centers separated by the Internet is growing in popularity due to an explosion in scalable computing demands and pay-as-you-go schemes offered on the cloud. While cloud-bursting is addressing this process of scaling up and down across data centers (i.e. between private and public clouds), offering service level guarantees, is a challenge for inter-cloud computation, particularly for best-effort traffic and large files. The parallel workload we address is real-time and involves inter-cloud processing and analysis of images and documents. In our production printing domain, dedicated processing/network resources are cost-prohibitive. Further, the problem is exacerbated by data intensive computing - we encounter huge file sizes atypical of intercloud parallel processing. To address these problems we propose three flavors of autonomic cloud-bursting schedulers that offer probabilistic guarantees on service levels required by customers (such as speed-up and queue sequence preservation) by adapting to changing workload characteristics, variation in bandwidth and available resources. In particular, these opportunistic schedulers use a quadratic response surface model for processing time in concert with a time-of-day dependent bandwidth predictor to increase the throughput and utilization while simultaneously reducing out-of-sequence completions for a document processing workload.","PeriodicalId":415472,"journal":{"name":"2010 39th International Conference on Parallel Processing Workshops","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128639866","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":"Energy Proportionality and the Future: Metrics and Directions","authors":"G. Varsamopoulos, S. Gupta","doi":"10.1109/ICPPW.2010.68","DOIUrl":"https://doi.org/10.1109/ICPPW.2010.68","url":null,"abstract":"This paper proposes a pair of quantitative metrics, namely the idle-to-power ratio (IPR) and the linear deviation ratio (LDR), to be used together for measuring the energy proportionality of computing systems. The metrics are applied to the publicly available SPECPower_ssj2008 benchmark results, yielding a partly grim trend of energy proportionality, which has to be addressed and possibly rectified by the computer industry. The paper also proposes future research directions on studying the effects of energy proportionality on software-based energy-saving techniques.","PeriodicalId":415472,"journal":{"name":"2010 39th International Conference on Parallel Processing Workshops","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124094146","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}
Luis Tomás, C. Carrión, María Blanca Caminero, A. Caminero
{"title":"Exponential Smoothing for Network-Aware Meta-scheduler in Advance in Grids","authors":"Luis Tomás, C. Carrión, María Blanca Caminero, A. Caminero","doi":"10.1109/ICPPW.2010.52","DOIUrl":"https://doi.org/10.1109/ICPPW.2010.52","url":null,"abstract":"Grid computing involves the coordinated use of disperse heterogeneous computing resources. This heterogeneity and dispersion makes Quality of Service (QoS) still an open issue requiring attention from the research community. One way of contributing to the provision of QoS in Grids is by performing meta-scheduling of jobs in advance, that is, the computing resource where a job will be executed is decided some time before jobs are actually executed. But this way of scheduling needs to do predictions about the future status of resources, including network. The main aim of this work is to provide QoS in Grid environments through network-aware job scheduling in advance. In our case, QoS means the fulfillment of a deadline for the completion of jobs. For this, predictions about future status of computing and network resources are made by using exponential smoothing functions. This paper presents a performance evaluation using a real testbed that illustrates the efficiency of this approach to meet the QoS requirements of users. This evaluation highlights the effects of using Exponential Smoothing (ES) to tune predictions in order to deliver the requested QoS.","PeriodicalId":415472,"journal":{"name":"2010 39th International Conference on Parallel Processing Workshops","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128615045","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":"Parallelization of Face Detection Engine","authors":"T. Shekhar, Kiran Varaganti","doi":"10.1109/ICPPW.2010.27","DOIUrl":"https://doi.org/10.1109/ICPPW.2010.27","url":null,"abstract":"Video processing is computationally intensive and often has accompanying real-time or super-real-time requirements. For example, video tagging and surveillance systems need to robustly analyze video and automatically recognize the faces in real time. The semiconductor industry has shifted from increasing clock speeds to a strategy of growth through increasing core counts. This shift from single core to multi-core presents a major challenge to application developers to exploit sufficient parallelism in performance-sensitive applications. This give rise to a new computation paradigm for developing more advance algorithms. In this paper, we present a method to efficiently parallelize face detection which can be extended to any object detection algorithms for SMP architectures. We also show that a well-designed parallel code of face detection algorithm will result in a performance gain in excess of 2X on dual core systems.","PeriodicalId":415472,"journal":{"name":"2010 39th International Conference on Parallel Processing Workshops","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134408125","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":"Predictive Space- and Time-Resource Allocation for Parallel Job Scheduling in Clusters, Grids, Clouds","authors":"A. Sodan","doi":"10.1109/ICPPW.2010.51","DOIUrl":"https://doi.org/10.1109/ICPPW.2010.51","url":null,"abstract":"Grid and cloud schedulers benefit from predictable service for their choices in allocating jobs on remote servers/clusters. Predictable service on local clusters supports fairness and user satisfaction. The paper looks into servers that employ batch scheduling and support time sharing and/or space partitioning of the available resources among different parallel-job workloads. This provides the basis for resource provisioning and differentiated QoS control according to certain targets. An M/G/1 queuing model is presented for prediction of average response times under different load and different time shares and/or space share allocation. Prediction is applied to both, a standard priority scheduler and a preemptive job scheduler. All average response-time predictions are based on a black-box queuing model with model fitting. The results, obtained with synthetic and real workload traces from supercomputing centers, show very high accuracies. In addition, the previously presented preemptive scheduler permits, by its design, very reliable estimations of individual-job response times.","PeriodicalId":415472,"journal":{"name":"2010 39th International Conference on Parallel Processing Workshops","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114589622","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}
E. Zeeb, Guido Moritz, D. Timmermann, F. Golatowski
{"title":"WS4D: Toolkits for Networked Embedded Systems Based on the Devices Profile for Web Services","authors":"E. Zeeb, Guido Moritz, D. Timmermann, F. Golatowski","doi":"10.1109/ICPPW.2010.11","DOIUrl":"https://doi.org/10.1109/ICPPW.2010.11","url":null,"abstract":"As the application of the Internet Protocol (IP) is not longer restricted to the internet and computer networks, future IP-based application scenarios require an enormous diversity of heterogeneous platforms and systems. Thereby emerging communication architectures, concepts, technologies and protocols must be capable of handling thousands of devices and communication endpoints on the one hand and be flexible and extensible enough on the other hand, to provide cross domain interoperability independent of platform specific constraints. The Devices Profile for Web Services (DPWS) is such a cross domain technology. This paper provides an overview of DPWS and existing DPWS implementations and toolkits with special focus on the Web Service for Devices (WS4D) initiative. Therefore, features and capabilities of DPWS are described in detail by referring to the open source WS4D implementations. The target platforms are ranging from resource rich server platforms down to highly resource constrained embedded devices.","PeriodicalId":415472,"journal":{"name":"2010 39th International Conference on Parallel Processing Workshops","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114808573","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":"An Efficient Secure Shared Storage Service with Fault and Investigative Disruption Tolerance","authors":"S. Erotokritou, S. Nair, T. Dimitrakos","doi":"10.1109/ICPPW.2010.43","DOIUrl":"https://doi.org/10.1109/ICPPW.2010.43","url":null,"abstract":"In this work we focus on solutions to an emerging threat to cloud-based services – namely that of data seizures within a shared multiple customer architecture. We focus on the problem of securing distributed data storage in a cloud computing environment by designing a specialized multi-tenant data-storage architecture. The architecture we present not only provides high degrees of availability and confidentiality of customer data but is also able to offer these properties even after seizures of various parts of the infrastructure have been carried out through a judicial process. Our solution uses a novel way of storing customer data ??? combining the cryptographic scheme of secret sharing and combinatorial design theory, to ensure that the requirements of the architecture are met. Furthermore, we show that our proposed solution is efficient with respect to the amount of hardware infrastructure required, thus making the implementation and use of our proposed architecture cost-efficient for adoption by IT enterprises.","PeriodicalId":415472,"journal":{"name":"2010 39th International Conference on Parallel Processing Workshops","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124381633","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}
Yasutsugu Nagatomi, M. Koibuchi, H. Kawashima, Koichi Inoue, H. Nishi
{"title":"A Regular Expression Processor Embedded in Service-Friendly Router for Future Internet","authors":"Yasutsugu Nagatomi, M. Koibuchi, H. Kawashima, Koichi Inoue, H. Nishi","doi":"10.1109/ICPPW.2010.23","DOIUrl":"https://doi.org/10.1109/ICPPW.2010.23","url":null,"abstract":"For the future application-friendly Internet, we have presented a router architecture that enables to interact with a variety of rich services. The proposed router snoops a traffic data stream, inspects the packet payload as well as packet headers, and stores the designated data in the associated database. The service-friendly router uses the technology of DPI (Deep Packet Inspection) for enriching services. For this purpose, high-throughput regular expression processing becomes a crucial component embedded in the router in order to extract the required information from traffic streams. Moreover, target patterns of the regular expression processing can be dynamically and frequently updated according to the applications requests. In this paper, we mainly focus on the design and evaluation of the high-throughput regular-expression processor. It accelerates the processing performance of OR matching (pipe(|)-based matching) that is familiar in various emerging applications of future Internet. The proposed regular-expression processor achieves a low overhead processing under the condition that the updates of the regular-expression patterns are frequently issued. Evaluation results show that the proposed processor achieves 6.0-Gbps throughput of regular-expression matching when using 45nm standard cell library.","PeriodicalId":415472,"journal":{"name":"2010 39th International Conference on Parallel Processing Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121668214","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}
S. A. Ostadzadeh, M. Corina, C. Galuzzi, K. Bertels
{"title":"tQUAD - Memory Bandwidth Usage Analysis","authors":"S. A. Ostadzadeh, M. Corina, C. Galuzzi, K. Bertels","doi":"10.1109/ICPPW.2010.39","DOIUrl":"https://doi.org/10.1109/ICPPW.2010.39","url":null,"abstract":"One of the main issues in heterogeneous reconfigurable computing is the well-known processor/memory bottleneck. Due to the memory bandwidth limitations, the performance of execution of an application can dramatically increase via the efficient usage of the memory. In this paper, we present tQUAD, a new tool for the memory bandwidth usage analysis. This tool is capable of delivering detailed temporal memory bandwidth usage information for the functions in an application throughout a comprehensive analysis of the memory access patterns of individual functions. This tool, first in its kind, provides an accurate analysis of the task execution and memory bandwidth usage which in the end leads to a sophisticated partitioning of the tasks into different phases during the execution span of an application. Together with an accurate description of the tool, the paper presents a real case study from the multimedia domain to detail all features of the proposed tool.","PeriodicalId":415472,"journal":{"name":"2010 39th International Conference on Parallel Processing Workshops","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122703380","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":"Memory-Aware Green Scheduling on Multi-core Processors","authors":"F. Pinel, Johnatan E. Pecero, P. Bouvry, S. Khan","doi":"10.1109/ICPPW.2010.71","DOIUrl":"https://doi.org/10.1109/ICPPW.2010.71","url":null,"abstract":"Contention on shared resources such as cache and main memory slows down the execution of the applications affecting not only application performance but also induces inefficient use of energy. Therefore, in this paper we deal with the contention problem and energy optimization on shared resources multicore-based machines. Our main contribution is a memory-aware resource allocation algorithm that minimize energy consumption by reducing contention conflicts and maximizing performance. We design a heuristic that includes in its objective function the impact of the contention on the application performance. Experimental results emphasize the interest of the provided solution.","PeriodicalId":415472,"journal":{"name":"2010 39th International Conference on Parallel Processing Workshops","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125163431","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}