2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)最新文献

筛选
英文 中文
A comparative analysis of database connection pooling implementations with emphasis on the added value of aspect orientation 数据库连接池实现的比较分析,重点介绍面向方面的附加价值
Lamya A. Othman, H. Hosny, S. Aly
{"title":"A comparative analysis of database connection pooling implementations with emphasis on the added value of aspect orientation","authors":"Lamya A. Othman, H. Hosny, S. Aly","doi":"10.1109/AICCSA.2011.6126629","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126629","url":null,"abstract":"Enterprise web based systems require an extremely vigilant management of database resources. Database connectivity is considered to be an important crosscutting, nonfunctional requirement that inevitably impacts the overall, runtime performance measures of the running web application. It is also a requirement that needs systematic resolution at the early phases of designing the web application under development due to its crosscutting nature. Database connection pooling can be seen as one of the more efficient solutions that will enhance the run-time performance of web/database transactional activities. Our work asserts that adopting an aspect-oriented approach for database connection pooling in web based systems promises for an even better improved run time performance of web based systems. In this study we analyze the run-time effects that result from applying three approaches upon cross cutting concerns of database connectivity in a developed web application. The three approaches are: An aspect-oriented approach (AOP), an object-oriented approach (OOP) or (Pool), and sequential calls to the native database driver approach (Native). The run-time effects were translated into run-time performance measures, namely, the average response time and successful hits percentage. We were able to demonstrate the added benefit of using an aspect-oriented approach for this problem.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"36 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":"130660387","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}
引用次数: 2
Sunspot series prediction using adaptively trained Multiscale-Bilinear Recurrent Neural Network 基于自适应训练多尺度双线性递归神经网络的太阳黑子序列预测
Dong-Chul Park
{"title":"Sunspot series prediction using adaptively trained Multiscale-Bilinear Recurrent Neural Network","authors":"Dong-Chul Park","doi":"10.1109/AICCSA.2011.6126609","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126609","url":null,"abstract":"A prediction scheme for sunspot series using a Recurrent Neural Network is proposed in this paper. The recurrent neural network adopted in this scheme is the Multiscale-Bilinear Recurrent Neural Network with an adaptive learning algorithm (M-BRNN (AL)). The M-BLRNN(AL) is formulated by a combination of several Bilinear Recurrent Neural Network (BRNN) models in which each model is employed for predicting the signal at a certain level obtained by a wavelet transform. The learning process is further improved by applying an adaptive learning algorithm at each resolution level. In order to evaluate the performance of the proposed M-BRNN(AL)-based predictor, experiments are conducted on the Wolf sunspot series number data and the resulting prediction accuracy is compared with those of conventional MultiLayer Perceptron Type Neural Network (MLPNN)-based and BRNN-based predictors. The results show that the proposed M-BRNN(AL)-based predictor outperforms the MLPNN-based and BRNN-based predictors in terms of the Normalized Mean Squared Error (NMSE).","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":"130231395","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}
引用次数: 2
Instruction and data cache peak temperature reduction using cache access balancing in embedded processors 在嵌入式处理器中使用缓存访问平衡来降低指令和数据缓存峰值温度
M. Taherian, A. Baniasadi, Hamid Noori
{"title":"Instruction and data cache peak temperature reduction using cache access balancing in embedded processors","authors":"M. Taherian, A. Baniasadi, Hamid Noori","doi":"10.1109/AICCSA.2011.6126591","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126591","url":null,"abstract":"In this work we study cache peak temperature variation under different cache access patterns. In particular we show that unbalanced cache access results in higher cache peak temperature. This is the result of frequent accesses made to overused cache sets. Moreover we study cache peak temperature under cache access balancing techniques and show that exploiting such techniques not only reduces cache miss rate but also results in lower peak temperature. Our study shows that balancing cache access reduces peak temperature by up to 20% and 12% for instruction and data caches respectively. This temperature reduction reduces peak temperature in neighbor components by up to 7%.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"48 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":"123307042","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
Economic grid fault tolerance scheduling using modified Genetic Algorithm 基于改进遗传算法的电网经济容错调度
Amir I. Alfoly, M. B. Abdelhalim, S. Senbel
{"title":"Economic grid fault tolerance scheduling using modified Genetic Algorithm","authors":"Amir I. Alfoly, M. B. Abdelhalim, S. Senbel","doi":"10.1109/AICCSA.2011.6126596","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126596","url":null,"abstract":"Computational grids allow the sharing of geographically distributed resources in an efficient way, extending the boundaries of what we perceive as distributed computing. It is a fact that the computational grid nodes are not 100% secure from failure. Here comes a problem on how to handle failing nodes and effectively schedule and distribute the required work on the participating nodes and, in the same time, provide assurance that the task will be completed successfully. Additionally, when applying a recovery technique to an Economic Grid, the problem of maintaining the cost arises. In this paper, we propose an enhancement to a fault tolerance Genetic Algorithm (GA) using a checkpoint recovery technique. The enhancement focuses on finding a schedule which tries to minimize the running costs resulting from the overhead of implementing fault tolerance technique and in the same time tries to satisfy the quality constraints of the user. The results show that without adding these factors, the schedule running costs may be uncontrollable from the point of view of the grid owner.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"11 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":"133511204","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}
引用次数: 3
A methodology for evaluating JavaScript execution behavior in interactive web applications 一种在交互式web应用程序中评估JavaScript执行行为的方法
Jan Kasper Martinsen, Håkan Grahn
{"title":"A methodology for evaluating JavaScript execution behavior in interactive web applications","authors":"Jan Kasper Martinsen, Håkan Grahn","doi":"10.1109/AICCSA.2011.6126611","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126611","url":null,"abstract":"JavaScript has gone from being a mechanism for providing dynamic web pages to an important component of many web applications. Currently one of the most popular type of web applications is so-called social networks, e.g., Facebook, Twitter, and MySpace. However, the workload and execution behavior of JavaScript in this context have not been fully explored or understood. In this paper we present a methodology for characterizing the JavaScript execution behavior in interactive web applications using deterministic execution of use cases. Then, we apply this methodology to evaluate a set of social network applications and compare their behavior to a set of established JavaScript benchmarks. Our results confirm previous studies that the execution behavior of social networks differ from established benchmarks. In addition, we identify one novel difference not published before, i.e., the use of anonymous functions in web applications.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"7 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":"121489723","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}
引用次数: 25
Characteristics of multi-attribute resources/queries and implications on P2P resource discovery 多属性资源/查询的特点及其对P2P资源发现的启示
H. M. N. Dilum Bandara, A. Jayasumana
{"title":"Characteristics of multi-attribute resources/queries and implications on P2P resource discovery","authors":"H. M. N. Dilum Bandara, A. Jayasumana","doi":"10.1109/AICCSA.2011.6126602","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126602","url":null,"abstract":"Though resource discovery is a fundamental requirement in collaborative peer-to-peer, grid, and cloud computing, very little is known about resource/query characteristics and their impact on resource discovery. Fundamental design choices for distributed resource advertising and querying are evaluated in the context of existing practical systems. First, a generic model for cost of resource discovery is presented. Second, multi-attribute resource and query characteristics from Planet-Lab and SETI@home are presented. We observe that attributes of both resources and queries are highly skewed, correlated, queries are less specific, and Generalized Pareto distribution is suitable for capturing the distribution of most dynamic attributes and their rate of change. Based on these observations, different design choices are evaluated for resource discovery in terms of their cost of advertising/querying, latency, load balancing, and routing table size. The findings indicate that superpeer-based architectures have the potential to support large-scale resource aggregation as they simultaneously balance the cost and load.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"51 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":"129739943","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}
引用次数: 11
AudioGene: Computer-based prediction of genetic factors involved in non-syndromic hearing impairment AudioGene:基于计算机的非综合征性听力障碍遗传因素预测
Kyle R. Taylor, Adam P. DeLuca, Corey W. Goodman, Bruce W. Tompkins, T. Scheetz, M. Hildebrand, P. Huygen, Richard J. H. Smith, T. Braun, T. Casavant
{"title":"AudioGene: Computer-based prediction of genetic factors involved in non-syndromic hearing impairment","authors":"Kyle R. Taylor, Adam P. DeLuca, Corey W. Goodman, Bruce W. Tompkins, T. Scheetz, M. Hildebrand, P. Huygen, Richard J. H. Smith, T. Braun, T. Casavant","doi":"10.1109/AICCSA.2011.6126605","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126605","url":null,"abstract":"AudioGene is a software system developed at the University of Iowa to classify and predict gene mutations that indicate causal or increased risk factors of disease. We focus on a concise example — the most likely genetic causes of a particular form of inherited hearing loss — ADNSHL. Whereas the cost and throughput involved in the collection of genomic data have advanced dramatically during the past decade, gathering and interpreting clinical information regarding disease diagnosis remains slow, costly and error-prone. AudioGene employs machine-learning techniques in an iterative procedure to prioritize probable genetic risk factors of disease, which are then verified with a molecular (wet lab) assay. In our current implementation AudioGene achieves 67% first-choice accuracy (versus 23% using a majority classifier). When the top three choices are considered, accuracy increases to 83%. This has numerous implications for reducing the cost of genetic screening as well as increasing the power of novel gene discovery efforts. While AudioGene is focused on hearing loss, the design and underlying mechanisms are generalizable to many other diseases including heart disease, cancer and mental illness.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"38 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":"126976977","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}
引用次数: 2
An architecture-based dynamic adaptation model and framework for adaptive software systems 基于体系结构的自适应软件系统动态自适应模型和框架
M. Hussein, H. Gomaa
{"title":"An architecture-based dynamic adaptation model and framework for adaptive software systems","authors":"M. Hussein, H. Gomaa","doi":"10.1109/AICCSA.2011.6126598","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126598","url":null,"abstract":"This paper describes an architecture-based dynamic adaptation model and framework for adaptive software systems. The framework provides for a reusable adaptation infrastructure and uses a layered architecture pattern. It also provides separation of concerns from the system's software architecture and supports internal state information checkpointing and restoration. Any dynamic software adaptation process, whether instigated internally or externally, makes runtime changes only to affected components. The dynamic adaptation model separates adaptation-impacted parts of a system from those that need not be concerned with the dynamic adaptation.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"3 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":"127720803","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 comparson of receiver initiated DLB schemes via Parallel DFS 通过并行DFS的接收机发起的DLB方案的比较
M. Hamad, S. Sharif
{"title":"A comparson of receiver initiated DLB schemes via Parallel DFS","authors":"M. Hamad, S. Sharif","doi":"10.1109/AICCSA.2011.6126581","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126581","url":null,"abstract":"This research focuses on the comparison of two commonly used receiver initiated Dynamic Load Balancing (DLB) Schemes. The schemes of which are the ARR (Asynchronous Round Robin) and RP (Random Polling) are comprehensively compared theoretically and practically, weighing their pros and cons. To present a case study for their application and thus comparison, an adapted version of the Parallel Depth First Search (Parallel DFS) algorithm makes use of them in solving the famous 8-puzzle problem.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"24 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":"122728907","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
Impact of parallel programming models and CPUs clock frequency on energy consumption of HPC systems 并行编程模型和cpu时钟频率对高性能计算系统能耗的影响
J. Balladini, R. Suppi, Dolores Rexachs, E. Luque
{"title":"Impact of parallel programming models and CPUs clock frequency on energy consumption of HPC systems","authors":"J. Balladini, R. Suppi, Dolores Rexachs, E. Luque","doi":"10.1109/AICCSA.2011.6126618","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126618","url":null,"abstract":"Energy consumption has become one of the greatest challenges in the field of high performance computing (HPC). The energy cost produced by supercomputers during the lifetime of the installation is similar to acquisition. Thus, besides its impact on the environment, energy is a limiting factor for the HPC. Our research aims to reduce the energy consumption of computer systems to run parallel HPC applications. In this article we analyse the possible influence on the energy consumption of parallel programming paradigms of shared memory (OpenMP) and message passing (MPI), and the behaviour of systems at different clock frequencies of CPUs. The results show that the programming model has a major impact on the energy consumption of computer systems. It was found that the impact of reduced clock frequencies on the execution time, energy efficiency, and maximum power consumption depends not only on the type of application but also on its implementation in a specific programming model. We believe that another criteria to consider when choosing a parallel programming model is the impact on energy consumption.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"53 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":"115056633","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}
引用次数: 26
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信