2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献

筛选
英文 中文
Benchmarking and Analysis of Variations of Work Stealing Scheduler on Clustered System 集群系统上偷工调度程序的测试与变化分析
Saurav Kumar, A. Sahu
{"title":"Benchmarking and Analysis of Variations of Work Stealing Scheduler on Clustered System","authors":"Saurav Kumar, A. Sahu","doi":"10.1109/PDCAT.2014.13","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.13","url":null,"abstract":"Classical work stealing is an efficient dynamic load-balancing technique in shared memory multiprocessor or multicore system. But the performance of the same classical work scheduling on cluster chip multicore is not appreciable. So modification to this is necessary to improve performance. In this paper, we have discussed many earlier proposed modifications, and also proposed some simplistic modifications to suite targeted clustered environment. We have described a methodology to evaluate all the variations of work stealing analytically and experimentally on multiprocessor simulator and on real platform. Our methodology of evaluation include designing of novel parametric synthetic benchmark, which can be used to mimic behavior (or profile) of many real life benchmarks. The designed synthetic benchmark caters a wide range of application profiles to evaluate the design space of both variations of work stealing algorithms and clustered chip multiprocessor. In this work, we found that if the number of available parallelism of the targeted application is higher and data sharing between tasks is high then one of the proposed modification of work stealing (probabilistic based victim search and threshold on size of migratable task) outperform the rest of the modifications.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115529575","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
Prediction of Spatial and Temporal Data: A Web Tool Based on Georeferenced Resources 时空数据预测:基于地理参考资源的Web工具
C. R. Valêncio, Carlos Henrique El Hetti Laurenti, L. Baida, Fernando Ferrari, Thatiane Kawabata, A. Colombini
{"title":"Prediction of Spatial and Temporal Data: A Web Tool Based on Georeferenced Resources","authors":"C. R. Valêncio, Carlos Henrique El Hetti Laurenti, L. Baida, Fernando Ferrari, Thatiane Kawabata, A. Colombini","doi":"10.1109/PDCAT.2014.29","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.29","url":null,"abstract":"Spatiotemporal data stored in geographic databases provide an evolutionary panorama about the characteristics of a specific region. With integration of prediction concepts and statistical functions to that data, it is possible to make inferences of obtained information, to support in many areas such as management of occupational health, environmental resources, quality of life and, others. In this article is proposed a strategy to calculate the locality of predicted spatial points with the temporal and statistic function series, which will be able to find regions with critical levels. In the concentrations of more dense occurrences, this strategy supports to choose prevention methods and offers a prediction analysis based on georeferenced resources. This work contributes towards to prediction, analysis and visualization of georeferenced data to reduce costs and improve the life quality.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122527174","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
Improve LLC Bypassing Performance by Memory Controller Improvements in Heterogeneous Multicore System 异构多核系统中内存控制器改进提高LLC旁路性能
Jianliang Ma, Jinglei Meng, Tianzhou Chen, Qingsong Shi, Minghui Wu, Li Liu
{"title":"Improve LLC Bypassing Performance by Memory Controller Improvements in Heterogeneous Multicore System","authors":"Jianliang Ma, Jinglei Meng, Tianzhou Chen, Qingsong Shi, Minghui Wu, Li Liu","doi":"10.1109/PDCAT.2014.22","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.22","url":null,"abstract":"The shared last-level cache (SLLC) in heterogeneous multicore system is an important memory component that shared and competitive between multiple cores, so how to improve the SLLC performance has become an important research area. Last-level cache (LLC) bypassing technique that bypasses the LLC a part of memory requests is one of the most effective methods. The bypassed requests are sent directly to off-chip main memory (DRAM) rather than eliminated. We find that the bypassed requests influence the original scheduling sequence in Memory Controller (MC) severely. Besides, immoderate bypassing will disturb the MC load balance. We propose a 3-step method memory that adjusts memory scheduling algorithm to optimize LLC bypassing performance. The first step is adding an independent bypass stream for bypassed requests. The second step is scheduling the bypass stream with a smaller probability than that of normal GPU stream. The third step is adding a guard mechanism for MC. By dynamically set and revoke the guard, we can avoid unbalanced bypassing. For case study, we applied the 3-step method on two modern memory schedulers. The experimental results show that after applied the 3-step method, the schedulers improve the system performance obviously.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123440136","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
TOUGH2-PETSc: A Parallel Solver for TOUGH2 TOUGH2- petsc:一个并行求解器
Daniel Hathorn, Yushu Wu, Zizhong Chen
{"title":"TOUGH2-PETSc: A Parallel Solver for TOUGH2","authors":"Daniel Hathorn, Yushu Wu, Zizhong Chen","doi":"10.1109/PDCAT.2014.35","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.35","url":null,"abstract":"TOUGH2 is a general-purpose numerical simulation program for multi-dimensional, multiphase, multicomponent fluid flows, heat transfer and contaminant transport in porous and fractured media. It has been used worldwide for geothermal reservoir engineering, nuclear waste isolation, environmental assessment and remediation, and modeling flow and transport in variably saturated media. TOUGH2 is very computationally intense, and the accuracy and scope of the simulation is limited by the amount of processing power available on a single computer. This makes it an ideal canadate for parallel computing, as more CPU power and memory is available. Furthermore, TOUGH2's main computational unit is a linear equation solver. In parallel computing, a lot of effort has been spent to develop highly efficient parallel linear equation solvers. In this paper, we present TOUGH2-PETSc, a parallel implementation of TOUGH2 that uses PETSc to solve the linear systems in TOUGH2. PETSc is a library of high-performance linear and non-linear equation solvers that has been throughly tested at scale. Based on TOUGH2 and PETSc, TOUGH2-PETSc gives TOUGH2 users the potential to perform larger scale and higher resolution simulations. Experimental results demonstrate that the parallel TOUGH2-PETSc shows improved performance over the sequential version.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123967319","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
Simulating Supercomputer Workload with Hpcwld Package for R 用hpcworld包模拟超级计算机工作负载
A. Rumyantsev
{"title":"Simulating Supercomputer Workload with Hpcwld Package for R","authors":"A. Rumyantsev","doi":"10.1109/PDCAT.2014.36","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.36","url":null,"abstract":"We present the hpcwld package that provides R [1] function for the workload (unfinished work) evaluation of a stochastic model of a supercomputer based on a modified Kiefer -- Wolfowitz recursion. Beyond the workload evaluation function, we provide functions that can be used for workload data input and output, as well as a distributional measure of correlation computation that might be useful for a real system workload analysis. The package can be obtained via Comprehensive R Archive Network [2].","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123774415","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 Novel Density Based Clustering Algorithm and its Parallelization 一种新的基于密度的聚类算法及其并行化
Xiaokang Li, Binbin Yu, Yinghua Zhou, Guangzhong Sun
{"title":"A Novel Density Based Clustering Algorithm and its Parallelization","authors":"Xiaokang Li, Binbin Yu, Yinghua Zhou, Guangzhong Sun","doi":"10.1109/PDCAT.2014.9","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.9","url":null,"abstract":"K-Means, a simple but effective clustering algorithm, is widely used in data mining, machine learning and computer vision community. K-Means algorithm consists of initialization of cluster centers and iteration. The initial cluster centers have a great impact on cluster result and algorithm efficiency. More appropriate initial centers of k-Means can get closer to the optimum solution, and even much quicker convergence. In this paper, we propose a novel clustering algorithm, Kmms, which is the abbreviation of k-Means and Mean Shift. It is a density based algorithm. Experiments show our algorithm not only costs less initialization time compared with other density based algorithms, but also achieves better clustering quality and higher efficiency. And compared with the popular k-Means++ algorithm, our method gets comparable accuracy, mostly even better. Furthermore, we parallelize Kmms algorithm based on OPenMP from both initialization and iteration step and prove the convergence of the algorithm.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"795 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133970230","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
Distributive Interoperable Executive Library (DIEL) for Systems of Multiphysics Simulation 面向多物理场仿真系统的分布式可互操作执行库
Kwai L. Wong, Logan Brown, J. Coan, D. White
{"title":"Distributive Interoperable Executive Library (DIEL) for Systems of Multiphysics Simulation","authors":"Kwai L. Wong, Logan Brown, J. Coan, D. White","doi":"10.1109/PDCAT.2014.16","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.16","url":null,"abstract":"As HPC capability and software adaptability continues to expand, the interest to perform complex system-wide simulations involving multiple interacting components grows. In this paper, we present a novel integrative software platform -- the Distributive Interoperable Executive Library (DIEL) - to facilitate the collaboration, exploration, and execution of multiphysics modeling projects suited for a diversified research community on emergent large-scale parallel computing platforms. It does so by providing a managing executive, a layer of numerical libraries, a number of commonly used physics modules, and two set of native communication protocols. DIEL allows users to plug in their individual modules, prescribe the interactions between those modules, and schedule communications between them. The DIEL framework is designed to be applicable for preliminary concept design, sensitivity prototyping, and productive simulation of a complex system.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131832739","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
Fault-Tolerant Routing Based on Improved Safety Levels in Pancake Graphs 基于改进安全等级的煎饼图容错路由
Y. Nishiyama, Y. Hirai, K. Kaneko
{"title":"Fault-Tolerant Routing Based on Improved Safety Levels in Pancake Graphs","authors":"Y. Nishiyama, Y. Hirai, K. Kaneko","doi":"10.1109/PDCAT.2014.20","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.20","url":null,"abstract":"In a parallel processing system, a pancake graph is one of the superior topologies for interconnection network because of the small diameter and the high degree. In previous research, fault-tolerant routing using restricted global information called safety levels in a pancake graph was proposed. But there are some rooms for improvement. Therefore, we propose a fault-tolerant routing algorithm based on improved safety levels to attain higher reach ability. In addition, we estimated the proposed method in time and space complexities, and carried out a computer experiment to verify its effectiveness.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126574170","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
Topic Block: Mining User Inner Interests for Text and Link Analysis in Social Networks 主题块:挖掘用户内在兴趣,用于社交网络中的文本和链接分析
W. Zang, Chuan Zhou, Xiao Wang, Li Guo
{"title":"Topic Block: Mining User Inner Interests for Text and Link Analysis in Social Networks","authors":"W. Zang, Chuan Zhou, Xiao Wang, Li Guo","doi":"10.1109/PDCAT.2014.33","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.33","url":null,"abstract":"Text corpus and link network are interrelated data in social networks. Discovering the inner relationship between these two kinds of data can help better understand the evolution mechanism underneath social networks. Moreover, social networks exhibit unique characteristics such as sparse and noisy in both text and link data. Thus, it is imperative to combine both text and link data to complement and correct mining results. However, previous work did not explore a uniform generative model that can unveil their inner relationship probably because of the difficulty to harness the heterogenous data in social networks. To address this issue, in this paper we present a generative model Topic Block that clearly pinpoints the latent concept underlying the text corpus and link network, i.e., User inner interests. In our generative model, user inner interests guide the generation of the topic and community distributions underlying the text corpus and link data. We can infer the topic and community distributions based on the user inner interests through both content and topology information. Compared to existing popular models, our method experimentally outperforms on three real world social network data sets.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"324 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134055805","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
Gravitational Search Algorithm Using CUDA 基于CUDA的引力搜索算法
Amirreza Zarrabi, E. Karuppiah, K. Yong, Ngo Chuan Hai, S. See
{"title":"Gravitational Search Algorithm Using CUDA","authors":"Amirreza Zarrabi, E. Karuppiah, K. Yong, Ngo Chuan Hai, S. See","doi":"10.1109/PDCAT.2014.38","DOIUrl":"https://doi.org/10.1109/PDCAT.2014.38","url":null,"abstract":"Many scientific and technical problems with massive computation requirements could benefit from the Graphics Processing Units (GPUs) using Compute Unified Device Architecture (CUDA) for high speed processing. Gravitational Search Algorithm (GSA) is a population-based metaheuristic algorithm that can be effectively implemented on GPU to reduce the execution time. In this paper we discuss possible approaches to parallelize GSA on graphics hardware using CUDA. An in-depth study of the computation efficiency of parallel algorithms and capability to effectively exploit the architecture of GPU is performed. Additionally, a comparative study of parallel and sequential GSA was carried out on a set of standard benchmark optimization functions. The results show a significant speedup that re-emphasizes the utility of CUDA based implementation for complex and computationally intensive parallel applications.","PeriodicalId":367758,"journal":{"name":"2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121444786","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
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学术官方微信
小红书