2012 11th International Symposium on Parallel and Distributed Computing最新文献_第4页

Sky Computing Platform for Legacy Distributed Application 遗留分布式应用的天空计算平台

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.47

S. Panica, D. Petcu, Iñigo Lazkanotegi Larrate, Tamás Máhr

引用次数: 4

Monte Carlo Methods for Electron Transport: Scalability Study 电子传递的蒙特卡罗方法:可扩展性研究

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.33

T. Gurov, E. Atanassov, A. Karaivanova

{"title":"Monte Carlo Methods for Electron Transport: Scalability Study","authors":"T. Gurov, E. Atanassov, A. Karaivanova","doi":"10.1109/ISPDC.2012.33","DOIUrl":"https://doi.org/10.1109/ISPDC.2012.33","url":null,"abstract":"The Monte Carlo methods (MCMs) are very convenient for parallel implementation because in many cases they can use powerful High performance computing (HPC) resources for achieving accurate results without losing their parallel efficiency. This advantage of MCMs is used by the scientists for solving large-scale mathematical problems derived from the life science, finances, computational physics, computational chemistry, and many other fields. In this work we consider a Monte Carlo method for solving quantum-kinetic integral equations describing electron transport in semiconductors. The presented algorithm is a part of set of algorithms involved in SET (Simulation of Electron Transport) application which is developed by our team. The SET application can be successfully used to support simulation of semiconductor devices at the nano-scale as well as other problems in computational electronics. Here we study scalability of the presented a Monte Carlo algorithm using Bulgarian HPC resources. Numerical results for parallel efficiency and computational cost are also presented. In addition we discuss the coordinated use of heterogeneous HPC resources from one and the same application in order to achieve a good performance.","PeriodicalId":287900,"journal":{"name":"2012 11th International Symposium on Parallel and Distributed Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130525312","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

A Coupling Tool for Parallel Molecular Dynamics-Continuum Simulations 平行分子动力学的耦合工具-连续体模拟

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.23

Philipp Neumann, Nikola Tchipev

引用次数: 8

Software Engineering as a Service for HPC 面向高性能计算的软件工程服务

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.13

M. Schmidberger, M. Schmidberger

引用次数: 4

Grid Framework for Parallel Investigations of Spiking Neural Microcircuits 脉冲神经微电路并行研究的网格框架

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.37

I. Muntean, M. Joldos

{"title":"Grid Framework for Parallel Investigations of Spiking Neural Microcircuits","authors":"I. Muntean, M. Joldos","doi":"10.1109/ISPDC.2012.37","DOIUrl":"https://doi.org/10.1109/ISPDC.2012.37","url":null,"abstract":"Simulation of spiking neural networks is computationally expensive and the employment of multicore processors can boost the performance of such simulations. Designing parallelization strategies that work well for different characteristics of the microcircuits entails expensive computations, leading to increased development times. To speed up the design of multicore software for computational neuroscience, we have developed a framework that exploits multicore systems available in grid computing environments. Due to the use of Grid SFEA plugins, common operations such as evaluation of parallelization strategies can be undertaken with very little effort. We evaluated the plugins for the development of a synchronous multicore spiking neural simulator. This uses the spike response model combined with the phenomenological model of spike time dependent synapse plasticity. The parallelization uses OpenMP, the microcircuits have small world topologies and count up to 104 neurons and 107 synapses with biological details. With this novel framework more complex investigations in computational neuroscience such as analysis of the dynamics of neural microcircuits could be tackled.","PeriodicalId":287900,"journal":{"name":"2012 11th International Symposium on Parallel and Distributed Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129485641","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

Towards a Multicore Communications API Implementation (MCAPI) for the Intel Single-Chip Cloud Computer (SCC) 面向英特尔单芯片云计算机的多核通信API实现(MCAPI)

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.28

Carsten Clauss, Simon Pickartz, Stefan Lankes, T. Bemmerl

引用次数: 9

Distributed Computation and Large-Scale Visualization in Heterogeneous Compute Environments 异构计算环境中的分布式计算和大规模可视化

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.20

A. Panagiotidis, D. Kauker, F. Sadlo, T. Ertl

引用次数: 6

A Non-static Data Layout Enhancing Parallelism and Vectorization in Sparse Grid Algorithms 一种增强稀疏网格算法并行性和向量化的非静态数据布局

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.34

G. Buse, D. Pflüger, A. Murarasu, R. Jacob

引用次数: 13

Diamond-Like Tiling Schemes for Efficient Explicit Euler on GPUs gpu上高效显式欧拉的类菱形平铺方案

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.42

Matthias Korch, Julien Kulbe, C. Scholtes

引用次数: 5

Social Aspects for Opportunistic Communication 机会主义交流的社会方面

2012 11th International Symposium on Parallel and Distributed Computing Pub Date : 2012-06-25 DOI: 10.1109/ISPDC.2012.41

Radu-Ioan Ciobanu, C. Dobre, V. Cristea, D. Al-Jumeily

{"title":"Social Aspects for Opportunistic Communication","authors":"Radu-Ioan Ciobanu, C. Dobre, V. Cristea, D. Al-Jumeily","doi":"10.1109/ISPDC.2012.41","DOIUrl":"https://doi.org/10.1109/ISPDC.2012.41","url":null,"abstract":"As wireless and 3G networks become more crowded, users with mobile devices experience difficulties in accessing the network. Opportunistic networks, created between mobile phones using local peer-to-peer connections, have the potential to solve such problems by dispersing some of the traffic to neighbouring smart phones. Recently various opportunistic routing and dissemination algorithms were proposed and evaluated in various scenarios emulating real-world phenomena as close as possible. Such algorithms generally rely on mobility patterns of users and the context of communication. In this we investigate the addition of social data to improve the performance of communication algorithms and data transmission schema. When the routing decision is influenced by the chance of a particular user being able to successfully carry the data to the next hop, we believe that opportunistic communication algorithms could greatly benefit not only from learning the behaviour of users, but also their history of contacts coupled with the online social familiarity patterns between them. We believe users tend to be in contact more with familiar sets of users, with whom they share common interests. We investigate our approach using two real-world traces collected in two different environments. We first investigate our hypothesis using mobility data collected in an indoor academic environment. We then evaluate our assumptions in an outdoor urban scenario. We present an analysis of our findings, highlighting key social and mobility behaviour factors that can influence such opportunistic solutions. Most importantly, we show that by adding knowledge such as social links between participants in an opportunistic network routing and dissemination algorithms can be greatly improved.","PeriodicalId":287900,"journal":{"name":"2012 11th International Symposium on Parallel and Distributed Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126497293","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}

引用次数: 23