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

Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)最新文献

筛选
英文 中文
Group protocol for quorum-based replication 用于基于仲裁的复制的组协议
Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568) Pub Date : 2000-07-04 DOI: 10.1109/ICPADS.2000.857683
Keijirou Arai, Katsuya Tanaka, M. Takizawa
{"title":"Group protocol for quorum-based replication","authors":"Keijirou Arai, Katsuya Tanaka, M. Takizawa","doi":"10.1109/ICPADS.2000.857683","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857683","url":null,"abstract":"Distributed applications are realized by cooperation of multiple objects. Objects in the systems are replicated to make the systems fault-tolerant. Read and write request messages are issued to the replicas in a quorum based scheme. A quorum based ordered relation among request messages is defined to make replicas consistent. We discuss a group protocol which supports a group of replicas with the quorum based ordered delivery of request messages.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116534033","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
Fast and cost effective cache invalidation in DSM DSM中快速且经济有效的缓存失效
Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568) Pub Date : 2000-07-04 DOI: 10.1109/ICPADS.2000.857734
Chang-Kyu Lee, Jong Hyuk Choi, K. Park, B. Kim
{"title":"Fast and cost effective cache invalidation in DSM","authors":"Chang-Kyu Lee, Jong Hyuk Choi, K. Park, B. Kim","doi":"10.1109/ICPADS.2000.857734","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857734","url":null,"abstract":"Most distributed shared memory systems use point-to-point networks in conjunction with directory-based cache coherence protocols. A cache invalidation transaction generates a number of unicast invalidation messages and as many acknowledgment messages. This results in heavy network traffic, high latency, and high occupancy at home nodes. This paper introduces a fast cache invalidation method, called collective cache invalidation (CCI), and its simple and cost effect implementation method, called virtual bus based collective cache invalidation (VCCI). The simulation results show that we can reduce the total network traffic up to 45% and the overall execution time up to 11% by VCCI. The proposed method keeps the system scalable-the growth rate of the implementation cost if O(N/spl radic/N), and, VCCI can reduce the complexity of coherence protocol and make directory controllers simple since it does not require acknowledgment messages.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122371800","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
Parallel spatial joins using grid files 使用网格文件的平行空间连接
Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568) Pub Date : 2000-07-04 DOI: 10.1109/ICPADS.2000.857739
Jin-Deog Kim, B. Hong
{"title":"Parallel spatial joins using grid files","authors":"Jin-Deog Kim, B. Hong","doi":"10.1109/ICPADS.2000.857739","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857739","url":null,"abstract":"The most costly spatial operation in spatial databases is spatial join which combines objects from two data sets based on spatial predicates. Even if the execution time of sequential processing of a spatial join has been considerably improved, the response time is far from meeting the requirements of interactive users. In this paper, we have developed two kinds of parallel spatial join algorithms based on grid files: a parallel spatial join using a multi-assignment grid file and a parallel spatial join using a single-assignment grid file. We also present the cost of the two join algorithms in terms of the number of MBR comparisons. The experimental tests on the MIMD parallel machine with shared disks show that the first join algorithm based on disjoint decomposition of a data space outperforms the second based on non-disjoint decomposition.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129824915","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
Cooperative workflows to coordinate asynchronous cooperative applications in a simple way 协作工作流以一种简单的方式协调异步协作应用程序
Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568) Pub Date : 2000-07-04 DOI: 10.1109/ICPADS.2000.857724
C. Godart, F. Charoy, O. Perrin, H. Skaf-Molli
{"title":"Cooperative workflows to coordinate asynchronous cooperative applications in a simple way","authors":"C. Godart, F. Charoy, O. Perrin, H. Skaf-Molli","doi":"10.1109/ICPADS.2000.857724","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857724","url":null,"abstract":"Current workflow models are mainly concerned with the automation of administrative and production business processes. These processes coordinate well-defined activities which execute in isolation, i.e. synchronize only at their start/terminate states. If these models can be applied efficiently for a class of applications, they show their limits when one wants to model the subtlety of cooperative interactions as they occur in more creative processes, typically co-design and co-engineering processes. In this paper, we introduce the concept of cooperative workflow, i.e. a workflow model which extends classical workflow models with capabilities to synchronize activities interacting not only when they start and when they terminate, but also at any point of their execution. In the spirit of the workflow approach, the modelling and enactment of cooperative workflows must remain simple.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124763564","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}
引用次数: 15
A fault-tolerant adaptive and minimal routing approach in 3-D meshes 三维网格容错自适应最小路由方法
Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568) Pub Date : 2000-07-04 DOI: 10.1109/ICPADS.2000.857706
Jie Wu
{"title":"A fault-tolerant adaptive and minimal routing approach in 3-D meshes","authors":"Jie Wu","doi":"10.1109/ICPADS.2000.857706","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857706","url":null,"abstract":"We propose a sufficient condition for minimal routing in 3-dimensional (3D) meshes with fault nodes. Unlike many traditional models that assume all the modes know global fault distribution or just adjacent fault information, our approach is based on the concept of limited global fault information. First, we propose a fault model called faulted cube in which all faulty nodes in the system are contained in a set of faulty cubes. Fault information is then distributed to limited number of nodes while it is still sufficient to support minimal routing. The limited fault information collected at each node is represented by a vector called extended safety level. The extended safety level associated with a node can be used to determine the existence of a minimal path from this node to a given destination. Our results show that any minimal routing that is partially adaptive can be applied in our model as long as the destination node meets a certain condition. We also propose a dynamic planar adaptive routing scheme that offers better fault tolerance and adaptivity than the planar adaptive routing scheme in 3D meshes. Our approach is the first attempt to address adaptive and minimal routing in 3D meshes with faulty nodes using limited fault information.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130740767","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}
引用次数: 22
Optimal fault-tolerant routing in hypercubes using extended safety vectors 基于扩展安全向量的超立方体中最优容错路由
Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568) Pub Date : 2000-07-04 DOI: 10.1109/ICPADS.2000.857707
Jie Wu, F. Gao, Zhongcheng Li, Y. Min
{"title":"Optimal fault-tolerant routing in hypercubes using extended safety vectors","authors":"Jie Wu, F. Gao, Zhongcheng Li, Y. Min","doi":"10.1109/ICPADS.2000.857707","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857707","url":null,"abstract":"Reliable communication in cube-based multicomputers using the extended safety vector concept is studied. Each node in a cube-based multicomputer of dimension n is assorted with an extended safety vector of n bits, which is an approximated measure of the number and distribution of faults in the neighborhood. In the extended safety vector model, each node knows fault information within distance-2 and fault information outside distance-2 is coded in a special way based on the coded information of its neighbors. The extended safety vector of each node can be easily calculated through n-1 rounds of information exchanges among neighboring nodes. Optimal unicasting between two nodes is guaranteed if the kth bit of the safety vector of the source node is one, where k is the Hamming distance between the source and destination nodes. In addition, the extended safety vector can be used as a navigation tool to direct a message to its destination through a minimal path. Simulation results show a significant improvement in terms of optimal routing capability in a hypercube with faulty links using the proposed model, compared with the one using the original safety vector model.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123722318","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
Flexible multimedia system architecture with adaptive QoS guarantee functions 灵活的多媒体系统架构，具有自适应QoS保障功能
Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568) Pub Date : 2000-07-04 DOI: 10.1109/ICPADS.2000.857690
K. Hashimoto, Y. Shibata, N. Shiratori
{"title":"Flexible multimedia system architecture with adaptive QoS guarantee functions","authors":"K. Hashimoto, Y. Shibata, N. Shiratori","doi":"10.1109/ICPADS.2000.857690","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857690","url":null,"abstract":"Proposes a flexible multimedia system (FMS) which is based on an agent-oriented architecture. The system is able to organize the required functions itself, and to provide both real-time and stored multimedia information services simultaneously to users, even though various users' multimedia environments and the resource utility of the computers or networks have been dynamically changed. This distributed multimedia system not only integrates various multimedia information distributed over computer networks but it also provides that information to the users in accordance with their requirements during real-time multimedia communication which must guarantee the user-requested quality of service (QoS), even though the computer and network resources may change statically or dynamically. This paper describes the FMS architecture for a multimedia teleconferencing service with adaptive QoS-guarantee functions, and designs the FMS so as to implement a prototype system. In this teleconferencing service, the FMS is able to realize one of the multimedia communication services flexibly for service requests and QoS requests from users.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124971743","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
Software interoperability of telemedicine systems: a CSCW perspective 远程医疗系统的软件互操作性:CSCW视角
Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568) Pub Date : 2000-07-04 DOI: 10.1109/ICPADS.2000.857717
P. Ganguly, P. Ray
{"title":"Software interoperability of telemedicine systems: a CSCW perspective","authors":"P. Ganguly, P. Ray","doi":"10.1109/ICPADS.2000.857717","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857717","url":null,"abstract":"Computer supported cooperative work (CSCW) provides a fusion of the understanding of organisational processes with communication technologies. Telemedicine involves an integration of networking technologies with health-care processes. Since different modalities of patient care require applications running on heterogeneous computing environments, interoperability is a major issue in telemedicine. Software interoperability provides two distinctly classified benefits-benefits for the users of the system and benefits to the development and maintenance of the system. Software interoperability between different applications can be modeled at different levels of abstractions can be modeled at different levels of abstractions such as physical interoperability and semantic interoperability. Various mechanisms exist to resolve the problem at different levels. This paper presents the design issues of an interoperable. CSCW system in a distributed health-care environment through an illustrative study in the area of telecardiology.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129496411","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}
引用次数: 20
Some space considerations of VLSI systolic array mappings VLSI收缩阵列映射的一些空间考虑
Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568) Pub Date : 2000-07-04 DOI: 10.1109/ICPADS.2000.857720
J. H. Weston, Chang Nian Zhang, Hua Li
{"title":"Some space considerations of VLSI systolic array mappings","authors":"J. H. Weston, Chang Nian Zhang, Hua Li","doi":"10.1109/ICPADS.2000.857720","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857720","url":null,"abstract":"The space-time mapping of the dependency matrix of an algorithm is used to study spatial properties of a systolic array implementation of a 3-nested loop structure. Elementary expressions are developed for both the number of processing elements and the area of the array. These expressions involve only the space-time transformation and the lengths of the loops. As well, characterizations have been found for the form of the space-time transformation which produces a systolic array with the minimum number of processing elements, and one which has both the minimum number of processing elements and the smallest area. Moreover, the theorems can also be applied to more general algorithms, such as those with variable lengths of loops.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128567481","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
The net disk architecture for dynamic load balancing among disk arrays 在磁盘阵列之间实现动态负载均衡的网络磁盘架构
Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568) Pub Date : 2000-07-04 DOI: 10.1109/ICPADS.2000.857713
T. Kakeshita, Shenglin Zhang
{"title":"The net disk architecture for dynamic load balancing among disk arrays","authors":"T. Kakeshita, Shenglin Zhang","doi":"10.1109/ICPADS.2000.857713","DOIUrl":"https://doi.org/10.1109/ICPADS.2000.857713","url":null,"abstract":"A disk array is a proposed approach for a high-performance I/O subsystem. It requires dynamic load balancing against varying accesses to prevent some disks from becoming bottlenecks. Thus, we connected the disks by a bus and developed a local migration strategy to migrate data items with a high access frequency within the disk array. However, the bus may become a bottleneck when too many disks are connected to it. To solve this problem, we propose a net disk architecture, which contains multiple disk arrays connected by a crossbar network. Based on the load balancing within each disk array, a global migration strategy is developed to maintain the load balancing among the disk arrays. Therefore, load balancing is established for the entire architecture. Compared to conventional data reallocation techniques that are performed as a background process, dynamic load balancing is effectively maintained even though the disk arrays are burdened with a heavy load by the proposed architecture.","PeriodicalId":196466,"journal":{"name":"Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129958259","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
下一页 尾页
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学术官方微信