{"title":"A taxonomy of capabilities based DDoS defense architectures","authors":"Vamsi Kambhampati, C. Papadopoulos, D. Massey","doi":"10.1109/AICCSA.2011.6126615","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126615","url":null,"abstract":"DDoS defenses based on network capabilities advocate fundamental changes to the Internet. However, despite the many point solutions, there has not been a rigorous study of the entire solution space for capability architectures. We believe the proposed changes to the Internet will inevitably introduce challenges and tradeoffs. To better understand the tradeoffs and identify challenges, we propose a taxonomy to categorize possible options and map the potential solution space. Our taxonomy identifies key components of capability architectures, separates fundamentals from implementation details, and opens up new directions to explore in these architectures.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129700854","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}
Adam P. DeLuca, A. Wagner, Kyle R. Taylor, B. Faga, David Thole, V. Sheffield, E. Stone, T. Casavant, T. Scheetz, T. Braun
{"title":"Sequencing and disease variation detection tools and techniques","authors":"Adam P. DeLuca, A. Wagner, Kyle R. Taylor, B. Faga, David Thole, V. Sheffield, E. Stone, T. Casavant, T. Scheetz, T. Braun","doi":"10.1109/AICCSA.2011.6126607","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126607","url":null,"abstract":"Next-generation sequencing technology provides greater sequencing capacity to identify disease-causing variations. Currently there are many alignment tools and variation detection techniques, multiple SNP data sets used to filter out benign polymorphisms with the intent of enriching for disease-causing variations, and many tools and websites for annotating variations and performing pathogenicity prediction of variations. There is no consensus or standard with regards to which tools and corresponding parameter settings for each tool is appropriate for the different application of next-generation sequencing technologies for disease-causing variation identification. We have implemented an annotation pipeline that can easily use the output from different alignment tools (BLAT, BWA, BFAST, Bowtie) typically used to align sequence from next-generation sequencing and Sanger sequencing experiments. The Automated Sequence Analysis Pipeline (ASAP) reports variations using the HGVS standardized nomenclature[1] to facilitate comparison across tools and publications. To date, we have annotated the sequence from 13 exomes in an effort to identify disease-causing mutations.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114114016","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}
A. Aldahlawi, E. El-Araby, S. Suboh, T. El-Ghazawi
{"title":"Modelling the performance of an SSD-Aware storage system using least squares regression","authors":"A. Aldahlawi, E. El-Araby, S. Suboh, T. El-Ghazawi","doi":"10.1109/AICCSA.2011.6126623","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126623","url":null,"abstract":"Flash memory has lately been used as a cache located between the system main memory and the magnetic hard drives in order to create robust and cost effective hybrid storage systems. The reason comes from the growing density of Solid State Devices (SSDs) at lower prices with main advantage of high random read efficiency compared to magnetic hard drives. When predicting the performance of such hybrid storage systems, it is inevitable to study the trade-off in selecting the different storage elements such as the main memory and the SSD cache relative to the capacity of the magnetic hard drive. The parameters of such prediction model are determined based on the application that the storage system would serve. In this paper, a prediction model that uses experimental evaluation of a hybrid storage system and real applications/benchmarks is used. The model utilizes parameters of both the storage system and applications in order to predict system performance based on metrics that are commonly used in storage system evaluation. The model allows the designer to select the best hybrid storage system parameters that satisfy certain application performance requirements. The model is highly accurate with a minimal error and a high prediction confidence level (95%) in reference to the experimental data collected from real applications using the proposed SSD-aware hybrid storage system.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134423225","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":"Challenges to development of multipurpose global federated testbed for Future Internet experimentation","authors":"Mofassir Haque, K. Pawlikowski, S. K. Ray","doi":"10.1109/AICCSA.2011.6126626","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126626","url":null,"abstract":"Present Internet architecture is facing a number of challenges related to security, scalability, ubiquitous computing, management etc. Many initiatives are being carried out globally on designing new architecture for Future Internet which will address these issues. Large scale testbeds are required to validate new architectural designs. In this regard, two major initiatives being carried out are the European Union's (EU) Future Internet Research and Experimentation (FIRE) and USA's Global Environment for Network Innovations (GENI). Apart from these, other countries like Japan, China and Korea are also working towards their own testbeds. This paper gives an overview of large scale testbed initiatives across the world and discusses the major challenges to the development of the global Future Internet testbed. It also compares two major regional testbed architectures and suggests development of formal architecture for worldwide global testbed which will eliminate improvident investments of time, resources and duplicate efforts.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129903538","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}
Jonathan Apodaca, B. D. Young, L. Briceno, Jay Smith, S. Pasricha, A. A. Maciejewski, H. Siegel, Shirish Bahirat, Bhavesh Khemka, Adrian Ramirez, Yong Zou
{"title":"Stochastically robust static resource allocation for energy minimization with a makespan constraint in a heterogeneous computing environment","authors":"Jonathan Apodaca, B. D. Young, L. Briceno, Jay Smith, S. Pasricha, A. A. Maciejewski, H. Siegel, Shirish Bahirat, Bhavesh Khemka, Adrian Ramirez, Yong Zou","doi":"10.1109/AICCSA.2011.6126617","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126617","url":null,"abstract":"In a heterogeneous environment, uncertainty in system parameters may cause performance features to degrade considerably. It then becomes necessary to design a system that is robust. Robustness can be defined as the degree to which a system can function in the presence of inputs different from those assumed. In this research, we focus on the design of robust static resource allocation heuristics suitable for a heterogeneous compute cluster that minimize the energy required to complete a given workload. In this study, we mathematically model and simulate a heterogeneous computing system that is assumed part of a larger warehouse scale computing environment. Task execution times/energy consumption may vary significantly across different data sets in our heterogeneous cluster; therefore, the execution time of each task on each node is modeled as a random variable. A resource allocation is considered robust if the probability that all tasks complete by a system deadline is at least 90%. To minimize the energy consumption of a specific resource allocation, dynamic voltage frequency scaling (DVFS) is employed. However, other factors, such as system overhead (spent on fans, disks, memory, etc.) must also be mathematically modeled when considering minimization of energy consumption. In this research, we propose three different heuristics that employ DVFS to minimize energy consumed by a set of tasks in our heterogeneous computing system. Finally, a lower bound on energy consumption is provided to gauge the performance of our heuristics.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117310485","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 comparative study of PVD-based schemes for data hiding in digital images","authors":"El-Sayed M. El-Alfy, Azzat A. Al-Sadi","doi":"10.1109/AICCSA.2011.6126588","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126588","url":null,"abstract":"Unlike data encryption, steganography provides a crucial means for hiding confidential data into cover media so that the unauthorized person will not be aware of the existence of this data. This is particularly useful for protecting sensitive data that needs to be transmitted over a public access network such as the Internet. Several schemes have been proposed based on pixel value differencing with an attempt to increase the embedding capacity of secret data into digital images without significant loss in the perceived quality of the cover images. This paper aims to survey a number of methods that depend on or extend the pixel value differencing scheme. It also provides empirical comparison and discussion of the differences between the various methods.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122681436","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":"FIS-PNN: A hybrid computational method for protein-protein interaction prediction","authors":"S. A. Bakar, J. Taheri, Albert Y. Zomaya","doi":"10.1109/AICCSA.2011.6126594","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126594","url":null,"abstract":"The study of protein-protein interactions (PPI) is an active area of research in biology as it mediates most of the biological functions in any organism. Although, there are no concrete properties in predicting PPI, extensive wet-lab experiments suggest (with a high probability) that interacting proteins in the fine level share similar functions, cellular roles and sub-cellular locations. In this study, we developed a technique to predict PPI based on their secondary structures, co-localization, and function annotation. We proposed our approach, namely FIS-PNN, to predict the interacting proteins in yeast using hybrid machine learning algorithms. FIS-PNN has been trained and tested using 1029 proteins with 2965 known positive interactions; it could successfully predict PPI with 96% of accuracy — a level that is significantly greater than all other existing sequence-based prediction methods.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129628888","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":"GPU acceleration of an image characterization algorithm for document similarity analysis","authors":"Guochun Shi, V. Kindratenko, R. Kooper, P. Bajcsy","doi":"10.1109/AICCSA.2011.6126604","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126604","url":null,"abstract":"This paper aims to provide decision support for selecting software and hardware architecture for content-based document comparison. We evaluate Java, C, CUDA C and OpenCL implementations of an image characterization algorithm used for content-based document comparison on a CPU and NVIDIA and AMD graphics processing units (GPUs). Based on our experimental results, we conclude that the original Java implementation of the image characterization algorithm running on a CPU-based architecture can be accelerated by a factor of 6 if the Java code is re-implemented in C, or by a factor of almost 16 if the Java code is re-implemented in CUDA C and run on NVIDIA GTX 480 GPU hardware. We also provide a power efficiency analysis.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125910533","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. R. Martínez, Vicente Blanco Pérez, J. C. Cabaleiro, T. F. Pena, F. F. Rivera
{"title":"Estimating the effect of cache misses on the performance of parallel applications using analytical models","authors":"D. R. Martínez, Vicente Blanco Pérez, J. C. Cabaleiro, T. F. Pena, F. F. Rivera","doi":"10.1109/AICCSA.2011.6126587","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126587","url":null,"abstract":"In this paper a methodology to characterize the influence of cache misses on the performance of parallel applications is presented. This methodology is based on analytical models provided by the TIA framework. This framework obtains analytical models of given observable quantities by instrumenting the source code and applying model selection techniques. In particular, two metrics related with the performance are considered in this work: the number of cache misses and the elapsed time. Based on both models, the influence in terms of execution time due to the cache misses can be inferred. Two different versions of the parallel product of dense matrices are used as case of study.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130920186","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. Laosooksathit, Nichamon Naksinehaboon, C. Leangsuksun
{"title":"Two-level checkpoint/restart modeling for GPGPU","authors":"S. Laosooksathit, Nichamon Naksinehaboon, C. Leangsuksun","doi":"10.1109/AICCSA.2011.6126619","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126619","url":null,"abstract":"Due to the fact that the reliability and availability of a large scaled system inverse to the number of computing elements, fault tolerance has become a major concern in high performance computing (HPC) including a very large system with GPGPU. In this paper, we propose a checkpoint/restart mechanism model which employs two-phase protocol and a latency hiding technique such as CUDA streams in order to achieve a low checkpoint overhead. We introduce GPU checkpoint and restart protocols. Also, we show experimental results and analyze the influences of the mechanism, especially in a long-running application.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115050266","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}