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

The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05)最新文献

筛选
英文 中文
Extending OBDD Graphs for Composite Event Matching in Content-based Pub/Sub Systems 基于内容的Pub/Sub系统中用于组合事件匹配的扩展OBDD图
The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05) Pub Date : 2005-07-14 DOI: 10.1109/ICIS.2005.63
Gang Xu, W. Xu, Tao Huang
{"title":"Extending OBDD Graphs for Composite Event Matching in Content-based Pub/Sub Systems","authors":"Gang Xu, W. Xu, Tao Huang","doi":"10.1109/ICIS.2005.63","DOIUrl":"https://doi.org/10.1109/ICIS.2005.63","url":null,"abstract":"Content-based publish/subscribe offers a convenient abstraction for the information producers and consumers, supporting a large-scale system design and evolution by integrating several distributed independent application systems. Unlike in the traditional address-based unicast or multicast, its core problem is how to match events by predicates on the content of events. In existing matching approaches, matching predicates are composed by the conjunction and disjunction of non-semantic constraints. But, in context of enterprise application integration, although they can match events by their contents, this traditional matching predicates are not enough expressive in manipulating the complex event matching, such as the \"one-to-many\" and \"many-to-one\" matching. Therefore, traditional matching approaches should be extended to solve the complex matching problems. After analyzing information matching patterns in enterprise application integration, we propose three matching models, extend the simple matching to the multi-semantic matching and introduce the temporal constraint variable. The multi-semantic matching allows using different operations in accordance with different semantics; the temporal constraint variable supports processing the discrete events in the temporal sequence. Then, we extend OBDD graphs into hierarchy coloured OBDD graphs and prove the equivalence of the transformation. Based on the extended OBDD graphs, the composite matching algorithm is presented and analysed. By experiments, we show the proposed algorithm is efficient","PeriodicalId":397290,"journal":{"name":"The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133653779","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
Data distribution for failure correlation management in a Peer to Peer storage system 点对点存储系统中故障关联管理的数据分布
The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05) Pub Date : 2005-07-04 DOI: 10.1109/ISPDC.2005.20
Cyril Randriamaro, Olivier Soyez, G. Utard, Francis Wlazinski
{"title":"Data distribution for failure correlation management in a Peer to Peer storage system","authors":"Cyril Randriamaro, Olivier Soyez, G. Utard, Francis Wlazinski","doi":"10.1109/ISPDC.2005.20","DOIUrl":"https://doi.org/10.1109/ISPDC.2005.20","url":null,"abstract":"This article presents a dynamic data distribution method for data storage in a P2P system. In our system (named Us), peers are arranged in groups called metapeers to deal with account failure correlation. To minimize end user traffic according to the reconstruction process, distribution must take into account a new measure: the maximum disturbance cost of a peer. In a previous work, we defined a static distribution scheme which minimizes this reconstruction cost derived from affine plan theory. In this paper, we extend this distribution scheme to deal with the dynamic behaviour of peer to peer systems","PeriodicalId":397290,"journal":{"name":"The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05)","volume":"15 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127516576","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
Towards Scalable Grid Replica Optimization Framework 迈向可扩展网格副本优化框架
The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05) Pub Date : 2005-07-04 DOI: 10.1109/ISPDC.2005.52
M. Ciglan, L. Hluchý
{"title":"Towards Scalable Grid Replica Optimization Framework","authors":"M. Ciglan, L. Hluchý","doi":"10.1109/ISPDC.2005.52","DOIUrl":"https://doi.org/10.1109/ISPDC.2005.52","url":null,"abstract":"Data grids are becoming a popular infrastructure for distributed, data intensive scientific application. Data access optimization is one of the key features of such systems, as the transfer and access to the huge amounts of data are often the bottleneck of the data intensive tasks. Concept of replication, creation of multiple copies of a data source across multiple grid nodes, was adopted by grid community to increase data availability. In this paper, we present the ongoing work on the grid replica optimization framework that addresses both short-term and long-term replica optimization problems. We describe high level architecture of the optimization framework and discuss the promising results achieved by prototype implementation of several system components","PeriodicalId":397290,"journal":{"name":"The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124695991","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}
引用次数: 6
Task Scheduling for Dynamic SMP Clusters with Communication on the Fly for Bounded Number of Resources 有限资源下动态通信SMP集群的任务调度
The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05) Pub Date : 2005-07-04 DOI: 10.1109/ISPDC.2005.45
L. Masko
{"title":"Task Scheduling for Dynamic SMP Clusters with Communication on the Fly for Bounded Number of Resources","authors":"L. Masko","doi":"10.1109/ISPDC.2005.45","DOIUrl":"https://doi.org/10.1109/ISPDC.2005.45","url":null,"abstract":"The paper presents an algorithm for scheduling parallel tasks in a parallel architecture based on multiple dynamic SMP clusters. Processors can be switched between shared memory modules in the runtime. Memory modules and processors are organized in computational system on chip modules of a fixed size and are inter-connected by a local communication network implemented in a network-on-chip technology (NoC). Processors located in the same SoC module can share their data and communicate using a technique of data transfers on the fly. A number of such SoC modules can be connected using a global interconnection network to form a larger infrastructure. The presented algorithm schedules initial macro dataflow program graph for such an architecture with a given number of SoC modules, considering a fixed size of a module. First, it distributes program graph nodes among processors, assuming no distribution between SoC modules. Then it transforms and schedules computations and communications to use processor switching and read on the fly facilities. Finally, using genetic algorithm, it divides the whole set of processors into subsets of a given size, which then are mapped to separate SoC modules","PeriodicalId":397290,"journal":{"name":"The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121921593","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
Embedded cost model in mobile agents for large scale query optimization 面向大规模查询优化的移动代理嵌入成本模型
The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05) Pub Date : 2005-07-04 DOI: 10.1109/ISPDC.2005.23
Mohammad Hussein, F. Morvan, A. Hameurlain
{"title":"Embedded cost model in mobile agents for large scale query optimization","authors":"Mohammad Hussein, F. Morvan, A. Hameurlain","doi":"10.1109/ISPDC.2005.23","DOIUrl":"https://doi.org/10.1109/ISPDC.2005.23","url":null,"abstract":"Execution plans generated by traditional optimizers for large scale distributed queries can be sub-optimal because: the estimations are inaccurate, the data are unavailable and the execution environment is unstable. To deal with the sub-optimality, we propose to execute each relational operator of an execution plan by a mobile agent. A mobile agent can change its execution site in order to correct the sub-optimality. In this paper, we address the problem of choosing an execution site for a mobile agent among execution sites of the considered system. For this, we propose to integrate a cost model into the mobile agents. We define also the various interactions that might occur between a mobile agent and its execution site. The performance evaluation shows that the cost model embedded in the agent allows to choose the most appropriate execution site","PeriodicalId":397290,"journal":{"name":"The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134461282","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}
引用次数: 14
Profiling Macro Data Flow Graphs for Parallel Implementation of FDTD Computations 为FDTD计算的并行实现绘制宏数据流程图
The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05) Pub Date : 2005-07-04 DOI: 10.1109/ISPDC.2005.40
A. Smyk, M. Tudruj
{"title":"Profiling Macro Data Flow Graphs for Parallel Implementation of FDTD Computations","authors":"A. Smyk, M. Tudruj","doi":"10.1109/ISPDC.2005.40","DOIUrl":"https://doi.org/10.1109/ISPDC.2005.40","url":null,"abstract":"In this paper, we present methodology, which enables designing and profiling macro data flow graphs that represent computation and communication patterns for the FDTD (finite difference time domain) problem in irregular computational areas. Optimized macro dataflow graphs (MDFG) for FDTD computations are generated in three main phases: generation of initial MDFG based on wave propagation area partitioning, MDFG nodes merging with load balancing to obtain given number of macro nodes and communication optimization to minimize and balance internode data transmissions. The computation efficiency for several communication systems (MPI, RDMA RB, SHMEM) is discussed. Relations between communication optimization algorithms and overall FDTD computation efficiency are shown. Experimental results obtained by simulation are presented","PeriodicalId":397290,"journal":{"name":"The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116476463","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
SSOR Preconditioned Conjugate Gradient Algorithm in Dynamic SMP Clusters with Communication on the Fly 动态通信SMP集群中的SSOR预条件共轭梯度算法
The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05) Pub Date : 2005-07-04 DOI: 10.1109/ISPDC.2005.44
B. Butrylo, M. Tudruj, L. Masko, Laurent Nicolas
{"title":"SSOR Preconditioned Conjugate Gradient Algorithm in Dynamic SMP Clusters with Communication on the Fly","authors":"B. Butrylo, M. Tudruj, L. Masko, Laurent Nicolas","doi":"10.1109/ISPDC.2005.44","DOIUrl":"https://doi.org/10.1109/ISPDC.2005.44","url":null,"abstract":"The paper concerns efficient parallel computation methods for solving matrix linear equations using the preconditioned conjugate gradient method. Efficient parallelization methods of the preconditioner module have been proposed based on execution in a special architecture of dynamically reconfigurable shared memory clusters. The assumed system is provided with a novel efficient inter-processor communication technique called communication on the fly, which is very suitable for fine grain parallel computations. Two-step parallel data decomposition is implemented in the elaborated preconditioner, which leads to the decrease of computation grain and overlapping of communication with computations. Comparative experimental results are presented of program execution efficiency in a standard distributed multicomputer cluster based on message passing and in the architecture of dynamic SMP clusters with the communication on the fly","PeriodicalId":397290,"journal":{"name":"The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129118103","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
Coordination of Components in a Distributed Discrete-Event System 分布式离散事件系统中组件的协调
The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05) Pub Date : 2005-07-04 DOI: 10.1109/ISPDC.2005.19
A. Khoumsi
{"title":"Coordination of Components in a Distributed Discrete-Event System","authors":"A. Khoumsi","doi":"10.1109/ISPDC.2005.19","DOIUrl":"https://doi.org/10.1109/ISPDC.2005.19","url":null,"abstract":"We propose a method for coordinating local components that observe a distributed discrete-event system R and execute actions depending on the current state of R. Coordination is achieved by allowing the components to communicate with one another. This communication helps the components to distinguish slates of R when necessary. This paper is illustrated in distributed supervisory control","PeriodicalId":397290,"journal":{"name":"The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122782689","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}
引用次数: 4
Managing MPICH-G2 Jobs with WebCom-G 利用WebCom-G管理MPICH-G2作业
The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05) Pub Date : 2005-07-04 DOI: 10.1109/ISPDC.2005.34
P. O'Dowd, Adarsh Patil, J. Morrison
{"title":"Managing MPICH-G2 Jobs with WebCom-G","authors":"P. O'Dowd, Adarsh Patil, J. Morrison","doi":"10.1109/ISPDC.2005.34","DOIUrl":"https://doi.org/10.1109/ISPDC.2005.34","url":null,"abstract":"This paper discusses the use of WebCom-G to handle the management & scheduling of MPICH-G2 (MPI) jobs. Users can submit their MPI applications to a WebCom-G portal via a Web interface. WebCom-G then selects the machines to execute the application on, depending on the machines available to it and the number of machines requested by the user. WebCom-G automatically & dynamically constructs a RSL script with the selected machines and schedules the job for execution on these machines. Once the MPI application has finished executing, results are stored on the portal server, where the user can collect them. A main advantage of this system is fault survival, if any of the machines fail during the execution of a job, WebCom-G can automatically handle such failures. Following a machine failure, WebCom-G can create a new RSL script with the failed machines removed, incorporate new machines (if they are available) to replace the failed ones and re-launch the job without any intervention from the user. The probability of failures in a grid environment is high, so fault survival becomes an important issue","PeriodicalId":397290,"journal":{"name":"The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130439724","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
Progressive Clustering for Database Distribution on a Grid 网格上数据库分布的渐进式聚类
The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05) Pub Date : 2005-07-04 DOI: 10.1109/ISPDC.2005.41
Valérie Fiolet, B. Toursel
{"title":"Progressive Clustering for Database Distribution on a Grid","authors":"Valérie Fiolet, B. Toursel","doi":"10.1109/ISPDC.2005.41","DOIUrl":"https://doi.org/10.1109/ISPDC.2005.41","url":null,"abstract":"The increasing availability of clusters and grids of workstations provides cheap and powerful resources for distributed data mining. To exploit these resources we need new algorithms adapted to this kind of environment, in particular with respect to the way to fragment data and to use this fragmentation. An \"intelligent\" distribution of data is required and can be obtained from clustering. Most existing parallel methods of clustering are developed for supercomputers with shared memory and hence can not be used on a grid. This paper presents a new clustering algorithm, called progressive clustering, which executes a clustering in an efficient and incremental distributed way. The data clusters resulting from this algorithm can subsequently be used in distributed data mining tasks","PeriodicalId":397290,"journal":{"name":"The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128780611","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}
引用次数: 10
下一页 尾页
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学术官方微信
小红书