Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.最新文献_第2页

Code generation for semi-lagrangian formulations 半拉格朗日公式的代码生成

Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267673

P. Mark, L. Wolters, G. Cats

引用次数: 1

OCEAN: the open computation exchange and arbitration network, a market approach to meta computing OCEAN:开放计算交换和仲裁网络，元计算的市场途径

Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267662

Pradeep Padala, C. Harrison, Nicholas Pelfort, E. Jansen, Michael P. Frank, Chaitanya Chokkareddy

{"title":"OCEAN: the open computation exchange and arbitration network, a market approach to meta computing","authors":"Pradeep Padala, C. Harrison, Nicholas Pelfort, E. Jansen, Michael P. Frank, Chaitanya Chokkareddy","doi":"10.1109/ISPDC.2003.1267662","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267662","url":null,"abstract":"Rapid advancements in processor and networking technologies have led to the evolution of cluster and grid computing frameworks. These high-performance computing environments exploit geographically distributed, diverse resources with the goal of providing efficient computing solutions to all kinds of parallel and distributed applications. OCEAN (Open Computation Exchange and Arbitration Network) provides a scalable market-based infrastructure to such meta-computing frameworks. OCEAN aims to build a marketplace where resources like CPU time, associated memory usage and network bandwidth are the traded commodities. This paper explains the technical challenges faced in the design of OCEAN and discusses our proposed solution. To facilitate finding suitable resources for buyers, we developed efficient matching and evolution protocols for the peer-to-peer matching network. The architecture and various components of OCEAN are described in detail. We implemented OCEAN on Java and .NET platforms and describe results from our preliminary experiments.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115374443","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}

引用次数: 51

Open eden: a portable fault tolerant CORBA architecture Open eden:一个可移植的容错CORBA体系结构

Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267648

F. Greve, M. Hurfin, J. Narzul

引用次数: 7

Strongly consistent global states detection using relative clock errors 使用相对时钟误差的强一致性全局状态检测

Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267642

J. Borkowski

引用次数: 3

An optimal algorithm of acknowledged broadcasting in ad hoc radio networks 自组织无线网络中确认广播的最优算法

Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267661

Takaya Okuwa, Wei Chen, K. Wada

引用次数: 6

Efficient code generation for automatic parallelization and optimization 有效的代码生成自动并行和优化

Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267639

C. Bastoul

引用次数: 66

tuBiG - A layered infrastructure to provide support for grid functionalities tuBiG——为网格功能提供支持的分层基础设施

Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267637

L. Alboaie, S. Buraga, S. Alboaie

引用次数: 8

Near-optimal dynamic task scheduling of precedence constrained coarse-grained tasks onto a computational grid 计算网格上受优先级约束的粗粒度任务的近最优动态任务调度

Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267647

N. Fujimoto, K. Hagihara

{"title":"Near-optimal dynamic task scheduling of precedence constrained coarse-grained tasks onto a computational grid","authors":"N. Fujimoto, K. Hagihara","doi":"10.1109/ISPDC.2003.1267647","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267647","url":null,"abstract":"The most common objective function of task scheduling problems is makespan. However, on a computational grid, the 2nd optimal makespan may be much longer than the optimal makespan because the speed of each processor of a grid varies over time. So, if the performance measure is makespan, there is no approximation algorithm in general for scheduling onto a grid. In contrast, recently the authors proposed the computing power consumed by a schedule as a criterion of the schedule. For the criterion, this paper gives a (1 + Lcp(n)ċm(loge(m-1)+1)/n)-approximation algorithm for scheduling precedence constrained coarse-grained tasks with the same length onto a grid where n is the number of tasks, m is the number of processors, and Lcp(n) is the length of the critical path of the task graph. The proposed algorithm does not use any prediction information on the performance of underlying resources. Lcp(n) is usually a sublinear function of n. So, the above performance guarantee converges to one as n grows. This result implies a non-trivial result that the computing power consumed by an application on a grid can be limited within (1 + Lcp(n)ċm(loge(m-1)+1)/n) times that required by an optimal schedule in such a case.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133432601","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}

引用次数: 35

Modified algorithm for efficient reasoning in qualitative belief networks 定性信念网络中高效推理的改进算法

Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267668

M. Scalem, M. Majumdar, A. Vashisth

{"title":"Modified algorithm for efficient reasoning in qualitative belief networks","authors":"M. Scalem, M. Majumdar, A. Vashisth","doi":"10.1109/ISPDC.2003.1267668","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267668","url":null,"abstract":"This paper introduces a computational framework for reasoning in Qualitative Belief Network (QBN) that derives its basis from inductive inference and reasoning. QBNs are essentially based on Bayesian Belief Networks (BBN), except that here the numerical probabilities of BBN are replaced by qualitative symbols. The relationships among the symbols provide a leeway to get good solutions with a qualitative approach to data utilization. The reasoning algebra is based on the usage of sign tables to propagate a belief through the QBN, in a guided approach to discover the causes in the causal relationships in QBN. This algorithm is also ideally suited to a distributed environment as it can absorb queries from multiple sources. \u0000 \u0000The basis of this paper is the work done by Marek J. Druzdzel and the propagation algorithm that was proposed by him and Max Henrion for QBNs [5]. Their algorithm had problems in dealing with situations that might arise in normal circumstances e.g. the degrees of Belief in a particular event. In this paper, we have addressed the above issues and extended the reasoning algorithm by adding more levels in Belief by utilizing certain logical implications derived from basic rules of reasoning. Our algorithm also handles the issue of interactive processing and reasoning thereby making it capable of being used in a distributed platform. Given any data model, this approach helps in efficient reasoning of a solution which may not be directly evident from the singular belief in QBN. We have also implemented this algorithm to handle real life situations and the results thus obtained are in keeping with our expectations.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132793468","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

Role activity diagrams as finite state processes 作为有限状态过程的角色活动图

Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267638

C. Bǎdicǎ, A. Bădică, Valentin Litoiu

引用次数: 22