发布求助
文献互助 智能选刊 最新文献

2012 International Conference on High Performance Computing & Simulation (HPCS)最新文献

筛选
英文 中文
An energy consumption model for Energy Efficient Ethernet switches 节能以太网交换机的能耗模型
2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266897
P. Reviriego, V. Sivaraman, Zhi Zhao, J. A. Maestro, A. Vishwanath, A. Sánchez-Macián, Craig Russell
{"title":"An energy consumption model for Energy Efficient Ethernet switches","authors":"P. Reviriego, V. Sivaraman, Zhi Zhao, J. A. Maestro, A. Vishwanath, A. Sánchez-Macián, Craig Russell","doi":"10.1109/HPCSim.2012.6266897","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266897","url":null,"abstract":"Ethernet is one of the first computer networking technologies for which a standard has been developed to improve its energy efficiency. The Energy Efficient Ethernet (IEEE 802.3az) standard was approved in 2010 and is expected to enable savings of several Terawatt hours (TWh) per year. As switches that implement the standard become available and are deployed, it is important to understand how their energy consumption depends on the number of active ports and their traffic. In this paper the energy consumption of small Energy Efficient Ethernet switches is analyzed in several experiments and based on the results a model for the energy consumption of Energy Efficient Ethernet switches is proposed. The model can be used to predict the energy savings when deploying the new switches and also for research on further energy saving techniques such as energy efficient routing or dynamic link shutdown.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114176512","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}
引用次数: 39
DEVS simulation of peer-to-peer file-sharing 点对点文件共享的DEVS模拟
2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266937
Alan Davoust, Gabriel A. Wainer, B. Esfandiari
{"title":"DEVS simulation of peer-to-peer file-sharing","authors":"Alan Davoust, Gabriel A. Wainer, B. Esfandiari","doi":"10.1109/HPCSim.2012.6266937","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266937","url":null,"abstract":"We present a framework to simulate a peer-to-peer (P2P) file-sharing network, based on the Discrete Event Systems Specification (DEVS) formalism. Our framework models a file-sharing network as a coupled model, comprising a network model and a large number of peer models. While most available network simulation tools focus on transportlevel dynamics, we provide extensible and reusable models for the file-sharing protocol and for the behavior of peers. These models, implemented using the CD++ toolkit, can readily be used on existing simulators, including parallel and real-time simulators. As a case study, we apply our framework to simulate a P2P web, and show the emergence of an interesting page distribution.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115738823","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}
引用次数: 1
On the energy optimization for precedence constrained applications using local search algorithms 基于局部搜索算法的优先级约束应用的能量优化
2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266902
Johnatan E. Pecero, H. J. F. Huacuja, P. Bouvry, Alejandro Santiago Pineda, Mario César López Locés, J. Barbosa
{"title":"On the energy optimization for precedence constrained applications using local search algorithms","authors":"Johnatan E. Pecero, H. J. F. Huacuja, P. Bouvry, Alejandro Santiago Pineda, Mario César López Locés, J. Barbosa","doi":"10.1109/HPCSim.2012.6266902","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266902","url":null,"abstract":"We investigate the problem of scheduling precedence constrained applications on a distributed heterogeneous computing system with the aim of minimizing schedule length and reducing energy consumption. We present a scheduling algorithm based on the best-effort idea that promotes local search algorithms and dynamic voltage scaling to reduce energy consumption. The final goal is to maintain a given performance while minimizing energy use. The proposed approach first uses a list-based scheduling algorithm to find near-optimal solutions for schedule length, then local search algorithms with dynamic voltage scaling are applied to reduce energy consumption. However the algorithm it's not allowed to deteriorate the schedule length computed by the best-effort algorithm. We discuss simulation results obtained with sets of real-world applications that emphasize the interest of the approach.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129707255","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}
引用次数: 13
Grid application oriented computational resource allocation strategy 面向网格应用的计算资源分配策略
2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266977
V. Bâcu, D. Gorgan
{"title":"Grid application oriented computational resource allocation strategy","authors":"V. Bâcu, D. Gorgan","doi":"10.1109/HPCSim.2012.6266977","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266977","url":null,"abstract":"The optimal allocation of computational resources for efficient and high performance Grid applications is not a trivial task and mainly arises a challenge for calibration and execution of huge hydrological models. Hydrological models are used to assess the sustainability and vulnerability of different geographical regions. However, the calibration process that is necessary for the SWAT hydrological models demands high computational resources. The gSWAT application allows the calibration in a flexible manner, by a Web-based interface, and by taking advantage of the computational resources provided by the Grid infrastructures. This paper presents one component of the gSWAT platform that deals with resource allocation, and highlights the parameters that should be taken into account by this component. These parameters are related with the complexity of the SWAT model but also with the availability of Grid resources. The paper argues by experimental results the impact of such parameters on the execution time, and generally on the system performance.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124308614","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}
引用次数: 1
Hybrid DNA Cellular Automata for pseudorandom number generation 伪随机数生成的混合DNA细胞自动机
2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266918
G. Sirakoulis
{"title":"Hybrid DNA Cellular Automata for pseudorandom number generation","authors":"G. Sirakoulis","doi":"10.1109/HPCSim.2012.6266918","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266918","url":null,"abstract":"During the last decades, certain research emphasis has been placed on building synthetic molecular machinery from DNA. In specific, biological systems in which individual molecules act, singly and in concert, as specialized machines result are called DNA machines. Recently, Autonomous DNA Turing Machines and DNA Cellular Automata were proposed as cellular computing devices that can serve as reusable, compact computing devices to perform (universal) computation. In this paper, we introduce 1-d Hybrid Autonomous DNA Cellular Automata (HADCA), able to run in parallel different CA rules with certain modifications on their molecular implementation and information flow compared to their origins. Moreover, a HADCA simulator was developed to encourage the possible use of the biological inspired computation tool. Finally, it is shown that a proposed 1-d HADCA can generate high-quality random numbers which can pass the statistical tests of DIEHARD, one of the most well known general test suites for randomness. Consequently, such a HADCA can be efficiently implemented for pseudorandom number generation (PRNG) reasons.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123347557","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}
引用次数: 15
A multi-objective genetic algorithm for minimising network security risk and cost 最小化网络安全风险和成本的多目标遗传算法
2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266959
V. Viduto, C. Maple, Wei Huang, A. Bochenkov
{"title":"A multi-objective genetic algorithm for minimising network security risk and cost","authors":"V. Viduto, C. Maple, Wei Huang, A. Bochenkov","doi":"10.1109/HPCSim.2012.6266959","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266959","url":null,"abstract":"Security countermeasures help ensure information security: confidentiality, integrity and availability(CIA), by mitigating possible risks associated with the security event. Due to the fact, that it is often difficult to measure such an impact quantitatively, it is also difficult to deploy appropriate security countermeasures. In this paper, we demonstrate a model of quantitative risk analysis, where an optimisation routine is developed to help a human decision maker to determine the preferred trade-off between investment cost and resulting risk. An offline optimisation routine deploys a genetic algorithm to search for the best countermeasure combination, while multiple risk factors are considered. We conduct an experimentation with real world data, taken from the PTA(Practical Threat Analysis) case study to show that our method is capable of delivering solutions for real world problem data sets. The results show that the multi-objective genetic algorithm (MOGA) approach provides high quality solutions, resulting in better knowledge for decision making.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117232990","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}
引用次数: 15
Performance improvements for the neoclassical transport calculation on Grid by means of pilot jobs 利用先导作业改进网格上新古典传输计算的性能
2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266981
A. J. Rubio-Montero, Francisco Castejón-Magaña, E. Huedo, M. Pascual, R. Mayo-García
{"title":"Performance improvements for the neoclassical transport calculation on Grid by means of pilot jobs","authors":"A. J. Rubio-Montero, Francisco Castejón-Magaña, E. Huedo, M. Pascual, R. Mayo-García","doi":"10.1109/HPCSim.2012.6266981","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266981","url":null,"abstract":"The neoclassical transport is a lower limit of the whole transport in plasmas confined in fusion devices, either stellarators or tokamaks. Even more, the determination of a vast database compiling monoenergetic and transport coefficients is very useful for coupling different codes, which can use those values as input data. The DKEsG application is able to obtain such parameters on Grid infrastructures. Since a large number of regular jobs are needed for filling the aforementioned database, a fast and robust execution scheme is necessary. For this purpose, a new DRMAA-enabled DKEsG version that makes use of a new generic pilot-job platform is used, avoiding the most significant overheads related to standard Grid middleware. This new developed mechanism is suitable for many other scientific applications involving high-throughput calculations.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114784924","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
Parallelisation strategies for large scale cellular automata frameworks in pharmaceutical modelling 制药建模中大规模元胞自动机框架的并行化策略
2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266916
Marija Bezbradica, M. Crane, H. Ruskin
{"title":"Parallelisation strategies for large scale cellular automata frameworks in pharmaceutical modelling","authors":"Marija Bezbradica, M. Crane, H. Ruskin","doi":"10.1109/HPCSim.2012.6266916","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266916","url":null,"abstract":"Cellular Automata (CA) properties facilitate the detail required for the bottom-up approach to modelling and simulation of a broad range of physico-chemical reactions. In pharmaceutical applications, CA models use a combination of discrete-event rules based on probabilistic distributions and fundamental physical laws to predict the behaviour of active substances (drug molecules) and structural changes in Drug Dissolution Systems (DDS) over time. Several models of this type have been described so far in the scientific literature. Yet, practical applications are lacking in the context of large-scale, high-precision, high-fidelity simulations. The key obstacle to parallelisation of such models is not only the amount of data involved, but also the fact that many of these models incorporate agent-like behaviour within the CA framework in order to describe pharmaceutical components. This makes communication across process boundaries expensive. In this paper, we apply different parallelisation strategies to a large scale CA framework, used to model coated drug spheres. We use two parallel-computing application programming interfaces (APIs), namely OpenMP and MPI, to partition the simulation space. We analyse the applicability of each API to the problem individually, as well as in the hybrid solution. We examine speedup potential and overhead for local and global communication for simulation speed and solution scalability. For these types of problems, our results show that performance is much improved for appropriate combinations of parallelisation solutions.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134193287","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}
引用次数: 8
Towards verified cloud computing environments 迈向经过验证的云计算环境
2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266896
F. Loulergue, F. Gava, N. Kosmatov, Matthieu Lemerre
{"title":"Towards verified cloud computing environments","authors":"F. Loulergue, F. Gava, N. Kosmatov, Matthieu Lemerre","doi":"10.1109/HPCSim.2012.6266896","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266896","url":null,"abstract":"As the usage of the cloud becomes pervasive in our lives, it is needed to ensure the reliability, safety and security of cloud environments. In this paper we study a usual software stack of a cloud environment from the perspective of formal verification. This software stack ranges from applications to the hypervisor. We argue that most of the layers could be practically formally verified, even if the work to verify all levels is huge.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131315914","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}
引用次数: 5
Simulation of the release and diffusion of neurotransmitters in neuronal synapses: Analysis and modelling 神经突触中神经递质释放和扩散的模拟:分析和建模
2012 International Conference on High Performance Computing & Simulation (HPCS) Pub Date : 2012-07-02 DOI: 10.1109/HPCSim.2012.6266997
Elena Gómez Barroso, J. Sánchez, Á. Merchán-Pérez
{"title":"Simulation of the release and diffusion of neurotransmitters in neuronal synapses: Analysis and modelling","authors":"Elena Gómez Barroso, J. Sánchez, Á. Merchán-Pérez","doi":"10.1109/HPCSim.2012.6266997","DOIUrl":"https://doi.org/10.1109/HPCSim.2012.6266997","url":null,"abstract":"Chemical synaptic transmisssion involves the release of a neurotransmitter that diffuses in the extracellular space and interacts with specific receptors located on the postsynaptic membrane. Computer simulation approaches provide fundamental tools for exploring various aspects of the synaptic transmission under different conditions. In particular, Monte Carlo methods can track the stochastic movements of neurotransmitter molecules and their interactions with other discrete molecules, the receptors. We have developed synaptic models that had a simple geometry as far as shape is concerned, but had a variable set of parameters that specified the dimensions of the structures involved in the synaptic junction. We have analyzed simulations based on these idealized models of excitatory synapses where AMPA receptors are present and the neurotransmitter involved is glutamate.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114483163","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
首页 上一页 下一页 尾页
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学术官方微信