2008 International Symposium on Parallel and Distributed Computing最新文献_第6页

Bitstreams Repository Hierarchy for FPGA Partially Reconfigurable Systems FPGA部分可重构系统的比特流存储库层次结构

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.14

P. Bomel, J. Diguet, G. Gogniat, J. Crenne

引用次数: 4

Token Loss Detection for Random Walk based Algorithm 基于随机游走算法的令牌丢失检测

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.70

Thibault Bernard, A. Bui, D. Sohier

引用次数: 0

A Threaded Divide and Conquer Symmetric Tridiagonal Eigensolver on Multicore Systems 多核系统上的线程分治对称三对角线特征求解器

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.44

A. Vidal, M. Boratto, P. Alonso

引用次数: 1

Scalable Dense Factorizations for Heterogeneous Computational Clusters 异构计算集群的可扩展密集分解

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.10

Ravi Reddy, Alexey L. Lastovetsky, P. Alonso

引用次数: 2

Investigating a Dynamic Loop Scheduling with Reinforcement Learning Approach to Load Balancing in Scientific Applications 基于强化学习的动态循环调度在科学应用中的负载平衡研究

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.25

M. Rashid, I. Banicescu, R. Cariño

{"title":"Investigating a Dynamic Loop Scheduling with Reinforcement Learning Approach to Load Balancing in Scientific Applications","authors":"M. Rashid, I. Banicescu, R. Cariño","doi":"10.1109/ISPDC.2008.25","DOIUrl":"https://doi.org/10.1109/ISPDC.2008.25","url":null,"abstract":"The advantages of integrating reinforcement learning (RL) techniques into scientific parallel time-stepping applications have been revealed in research work over the past few years. The object of the integration was to automatically select the most appropriate dynamic loop scheduling (DLS) algorithm from a set of available algorithms with the purpose of improving the application performance via load balancing during the application execution. This paper investigates the performance of such a dynamic loop scheduling with reinforcement learning (DLS-with-RL) approach to load balancing. The DLS-with-RL is most suitable for use in time-stepping scientific applications with large number of steps. The RL agent's characteristics depend on a learning rate parameter and a discount factor parameter. An application simulating wavepacket dynamics that incorporates a DLS-with-RL approach is allowed to execute on a cluster of workstations to investigate the influences of these parameters. The RL agent implemented two RL algorithms: QLEARN and SARSA learning. Preliminary results indicate that on a fixed number of processors, the simulation completion time is not sensitive to the values of the learning parameters used in the experiments. The results also indicate that for this application, there is no advantage of choosing one RL technique over another, even though the techniques differed significantly in the number of times they selected the various DLS algorithms.","PeriodicalId":125975,"journal":{"name":"2008 International Symposium on Parallel and Distributed Computing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114701608","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

A New Parallel Algorithm for the Frequent Itemset Mining Problem 频繁项集挖掘问题的一种新的并行算法

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.45

M. Craus

{"title":"A New Parallel Algorithm for the Frequent Itemset Mining Problem","authors":"M. Craus","doi":"10.1109/ISPDC.2008.45","DOIUrl":"https://doi.org/10.1109/ISPDC.2008.45","url":null,"abstract":"A new parallel algorithm for finding the frequent itemsets in databases is presented. It differs fundamentally of well known Apriori algorithm, where at the beginning of every step, the dimension of the new frequent itemsets increases by 1 . In our algorithm the frequent itemsets are determined by progressively enlarging the interval which the individual items appertain, i.e. if at the k-th step the new candidates are from [i, i+k] intervals, i=1, 2,..., n-k, at the next step, k+1, the new candidates will belong to [i, i+k+1] intervals, i=1, 2,..., n-k-1. The frequent individual items are identified by their index. The basic idea is that the new frequent itemsets with individual items from the interval [i, j], simultaneously contain the items i and j. The frequent itemsets are built by sharing the work between n processors. Hereby, the processor Pi computes, step by step, the sets Fi,j of the frequent itemsets with individual items from the intervals [i, j], j=i,..., n. In order to compute the set Fi,j, the processing unit Pi uses Fi,j-1 obtained in the previous step and Fi+1,j received from the processor Pi+1. The main advantage of our parallel algorithm is that it uses a communication pattern known before algorithm start, which allows mapping communication to hardware. Another major advantage is that the set of the transactions can be distributed to processors prior to beginning. This is possible because a processor Pi has to compute Fi,j, j=i,..., n and therefore only the transactions containing the frequent item i are needed.","PeriodicalId":125975,"journal":{"name":"2008 International Symposium on Parallel and Distributed Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133616956","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}

引用次数: 9

Semantic Approach to Capability and Capacity Computing 能力和容量计算的语义方法

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.67

J. Kitowski

引用次数: 1

A Link-failure Resilient Token based Mutual Exclusion Algorithm for Directed Graph Topology 一种基于链路故障弹性令牌的有向图拓扑互斥算法

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.17

Sukhendu Kanrar, S. Choudhury, N. Chaki

引用次数: 4

Context Modeling for Urban Mobile Applications 城市移动应用的上下文建模

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.22

Romain Williot, D. Grigoras

引用次数: 0

Design and Implementation of a Service-integrated Session Layer for Efficient Message Passing in Grid Computing Environments 网格计算环境下高效消息传递的服务集成会话层设计与实现

2008 International Symposium on Parallel and Distributed Computing Pub Date : 2008-07-01 DOI: 10.1109/ISPDC.2008.41

Carsten Clauss, Stefan Lankes, T. Bemmerl

{"title":"Design and Implementation of a Service-integrated Session Layer for Efficient Message Passing in Grid Computing Environments","authors":"Carsten Clauss, Stefan Lankes, T. Bemmerl","doi":"10.1109/ISPDC.2008.41","DOIUrl":"https://doi.org/10.1109/ISPDC.2008.41","url":null,"abstract":"When running large parallel applications with demands for resources that exceed the capacity the local computing site offers, the deployment in a distributed grid environment may help to satisfy these demands. However, since such an environment is a heterogeneous system by nature, there are some drawbacks that, if not taken into account, are limiting its applicability.First of all, one has to apply a meta-computing or Grid-enabled message-passing library in order to have the ability to route messages to remote sites as well as still being able to exploit fast site-local network facilities.Then, because the inter-site communication usually constitutes the system's bottleneck, appropriate quality of service parameters should be provided and policed for those connections during the application's execution. And finally, the parallel runtime environment of the distributed application should offer service interfaces in order to enable its interaction with Grid middleware. In this paper, we present a new library called ISI whose functionalities meet those requirements in terms of a session layer to be integrated into grid-enabled message-passing implementations.","PeriodicalId":125975,"journal":{"name":"2008 International Symposium on Parallel and Distributed Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122680528","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