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

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

筛选
英文 中文
ESCC: a new deadline-driven extension of the SCC protocol ESCC：SCC 协议新的截止日期驱动扩展
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267651
Jérôme Haubert, B. Sadeg, L. Amanton
{"title":"ESCC: a new deadline-driven extension of the SCC protocol","authors":"Jérôme Haubert, B. Sadeg, L. Amanton","doi":"10.1109/ISPDC.2003.1267651","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267651","url":null,"abstract":"In Real-Time DataBase Management Systems (RTDBMSs), both the integrity constraints of the database and the temporal constraints of the transactions must be respected. In this paper, we focus on the real-time concurrency control protocol SCC which combines the advantages of both pessimistic and optimistic concurrency control methods. This protocol distinguishes two kinds of transaction conflicts: the write-write conflicts resolved by the TWR (Thomas Write Rule [1]) method and the read-write and write-read conflicts resolved by the transaction duplication. In this paper, we propose to extend this protocol in two ways: (1) the TWR method is, to our mind, not applicable in real time context and (2) we propose a new deadline-driven method combined with the transaction duplication. Thus, more transactions will meet their deadlines.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"4 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":"129768482","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
Dynamic SMP clusters with communication on the fly 具有动态通信的动态SMP集群
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267671
L. Masko, M. Tudruj, G. Mounié, D. Trystram
{"title":"Dynamic SMP clusters with communication on the fly","authors":"L. Masko, M. Tudruj, G. Mounié, D. Trystram","doi":"10.1109/ISPDC.2003.1267671","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267671","url":null,"abstract":"The paper presents a comparative analysis of parallel implementation of the preconditioned conjugate gradient method with symmetric successive over relaxation preconditioner. Two parallel implementations are compared. The first one is a message passing version that turned out to be inefficient when executed on a typical cluster of workstations. The other one is an efficient version simulated on a novel architecture of dynamically reconfigurable shared memory clusters with a new paradigm of inter-processor communication called communication on the fly. The presented example shows high suitability of the proposed architecture for fine grain numerical computations what can be very useful in simulation of physical phenomena described as numerical problems for fine grain parallel execution.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"69 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":"131293260","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}
引用次数: 12
Executing and visualizing high energy physics simulations with grid technologies 使用网格技术执行和可视化高能物理模拟
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267659
Marko Niinimäki, John White, J. Herrala
{"title":"Executing and visualizing high energy physics simulations with grid technologies","authors":"Marko Niinimäki, John White, J. Herrala","doi":"10.1109/ISPDC.2003.1267659","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267659","url":null,"abstract":"The emergence of the Grid computing model is important for disciplines that are computing and data storage-intensive. A generic web-based interface to a computing grid is presented. The package allows the user to submit a high energy physics simulation to Grid resources, track the progress of the job and upon job completion, display graphical results.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"166 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":"121614752","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 lost invalidation checking scheme for transaction consistency in mobile environments 一种用于移动环境中事务一致性的丢失无效检查方案
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267663
Nam-Shik Park, Tae-Gun Kang, Hyun Kim, Seong-il Jin
{"title":"A lost invalidation checking scheme for transaction consistency in mobile environments","authors":"Nam-Shik Park, Tae-Gun Kang, Hyun Kim, Seong-il Jin","doi":"10.1109/ISPDC.2003.1267663","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267663","url":null,"abstract":"In mobile environments, caching frequently accessed data is a widely accepted approach because of reducing the need to gain data from servers and to demand scare resources. However, an efficient cache invalidation strategy is required to maintain cache consistent. To invalidate the cache, the servers broadcast invalidation reports synchronously or asynchronously. In mobile environments, mobile clients may lose invalidation reports due to voluntarily or involuntarily disconnection. Thus, in this paper, we proposed a scheme checking lost invalidations that allows clients to disconnect from the network and ensures not to lose them even if the clients are disconnected. To support the scheme, a designated home station of a client keeps the lost invalidation reports so that the client receives them when reconnecting. Experimental results show that our scheme improves slightly commit success rate in mobile environments.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"9 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":"121798602","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
Lightweight logging and recovery for distributed shared memory over virtual interface architecture 通过虚拟接口架构实现分布式共享内存的轻量级日志记录和恢复
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267664
Soyeon Park, Youngjae Kim, S. Maeng
{"title":"Lightweight logging and recovery for distributed shared memory over virtual interface architecture","authors":"Soyeon Park, Youngjae Kim, S. Maeng","doi":"10.1109/ISPDC.2003.1267664","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267664","url":null,"abstract":"As software Distributed Shared Memory(DSM) systems become attractive on larger clusters, the focus of attention moves toward improving the reliability of systems. In this paper, we propose a lightweight logging scheme, called remote logging, and a recovery protocol for home-based DSM. Remote logging stores coherence-related data to the volatile memory of a remote node. The logging overhead can be moderated with high-speed system area network and user-level DMA operations supported by modern communication protocols. Remote logging tolerates multiple failures if the backup nodes of failed nodes are alive. It makes the reliability of DSM grow much higher. Experimental results show that our fault-tolerant DSM has low overhead compared to conventional stable logging and it can be effectively recovered from some concurrent failures.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"40 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":"115195716","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 distributed platform based on web services for multimedia resource discovery 一个基于web服务的分布式多媒体资源发现平台
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267644
S. Buraga, Petrica Gabureanu
{"title":"A distributed platform based on web services for multimedia resource discovery","authors":"S. Buraga, Petrica Gabureanu","doi":"10.1109/ISPDC.2003.1267644","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267644","url":null,"abstract":"The paper describes ITW - a multi-platform and multilanguage architecture used to discover (multimedia) resources. The ITW system is based on Web services and software agents, exploiting the relations between Web sites' resources. To represent these relations, a high-level RDF model is adopted, using Interval Temporal Logic.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"88 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":"115218815","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
Parallel explicit state reachability analysis and state space construction 并行显式状态可达性分析与状态空间构建
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267665
D. Petcu
{"title":"Parallel explicit state reachability analysis and state space construction","authors":"D. Petcu","doi":"10.1109/ISPDC.2003.1267665","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267665","url":null,"abstract":"An improvement is proposed for the algorithm described in [3] which allows the construction of the state space associated to a system. The improvement concerns the load balancing strategy. Different message-passing implementations on a cluster of workstations are also discussed.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"49 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":"116254770","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
Atomic operations for task scheduling for systems based on communication on-the-fly between SMP clusters 基于SMP集群之间动态通信的系统任务调度的原子操作
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267656
L. Masko
{"title":"Atomic operations for task scheduling for systems based on communication on-the-fly between SMP clusters","authors":"L. Masko","doi":"10.1109/ISPDC.2003.1267656","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267656","url":null,"abstract":"Communication on-the-fly is a new, very efficient method of transferring data between shared memory processor clusters. It is based on synergy of processor switching between clusters and multiple reads of data from a transmission network shared by many processors. Effective use of this communication requires from the program to be specially structured. This paper presents a proposal of scheduling technique for programs given as Extended Macro-Dataflow Graphs. Scheduling is based on introducing proper transformations to the program graphs that reduce execution time of the program. These transformations work only on small subgraphs of the whole graph, but give global execution speedup. They are designed to use special architectural features such as communication on-the-fly and processor switching between clusters. Property of locality allows to preserve in every step the advantages of transformations applied to the graph earlier. The paper presents a set of such transformations. To show usefulness of them, an exemplary scheduling algorithm, which uses these transformations and an example of its application are presented.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"31 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":"115058047","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}
引用次数: 11
Performance and cost effectiveness of a cluster of workstations and MD-GRAPE 2 for MD simulations 用于MD模拟的工作站集群和MD- grape 2的性能和成本效益
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267670
J. Sumanth, D. Swanson, Hong Jiang
{"title":"Performance and cost effectiveness of a cluster of workstations and MD-GRAPE 2 for MD simulations","authors":"J. Sumanth, D. Swanson, Hong Jiang","doi":"10.1109/ISPDC.2003.1267670","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267670","url":null,"abstract":"Molecular dynamics (MD) simulations are performed on systems of various sizes up to 32 million atoms. Performance is compared between an MD-GRAPE 2 board, specialized hardware optimized for MD, and a general purpose cluster computer utilizing varied numbers of processors for both short- and long-range potentials. While it is possible to outperform a single MD-GRAPE 2 board with a sufficient number of processors, tests verses a local cluster and comparison of original purchase price show the MD-GRAPE 2 board is often cost-effective. Potential-specific considerations are discussed.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"106 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":"115834532","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
Swarming agents for discovering clusters in spatial data 用于发现空间数据簇的群代理
Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings. Pub Date : 2003-10-13 DOI: 10.1109/ISPDC.2003.1267646
G. Folino, Agostino Forestiero, G. Spezzano
{"title":"Swarming agents for discovering clusters in spatial data","authors":"G. Folino, Agostino Forestiero, G. Spezzano","doi":"10.1109/ISPDC.2003.1267646","DOIUrl":"https://doi.org/10.1109/ISPDC.2003.1267646","url":null,"abstract":"The purpose of this work is to investigate the use of new swarm intelligence based techniques for data mining. According to this approach the data mining task is constructed as a set of biologically inspired agents. Each agent represents a simple task and the success of the method depends on the cooperative work of the agents. In this paper, we present a novel algorithm that uses techniques adapted from models originating from biological collective organisms to discover clusters of arbitrary shape, size and density in spatial data. The algorithm combines a smart exploratory strategy based on the movements of a flock of birds with a shared nearest-neighbor clustering algorithm to discover clusters in parallel. In the algorithm, birds are used as agents with an exploring behavior foraging for clusters. Moreover, this strategy can be used as a data reduction technique to perform approximate clustering efficiently. We have applied this algorithm on synthetic and real world data sets and we have measured, through computer simulation, the impact of the flocking search strategy on performance.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"358 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":"122749395","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}
引用次数: 7
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信