首页 > 最新文献

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)最新文献

英文 中文
Adaptive and fault-tolerant routing with 100% node utilization for mesh multicomputer 网格多计算机节点利用率100%的自适应容错路由
Sheng-de Wang, Ming-Jer Tsai
We propose an adaptive and deadlock-free routing algorithm to tolerate irregular faulty patterns using two virtual channels per physical link. It can improve the node utilization up to 100%. When a node becomes faulty or recovered, the central control unit constructs a directed path graph which is used for generating the intermediate nodes of the message path. Thus a message can be transmitted from sources or to destinations within faulty blocks via a set of "intermediate nodes". Our method requires the global failure information if the central control unit is not available.
我们提出了一种自适应和无死锁的路由算法,以容忍不规则的故障模式,每个物理链路使用两个虚拟通道。它可以将节点利用率提高到100%。当节点发生故障或恢复时,中央控制单元构建一个有向路径图,用于生成消息路径的中间节点。因此,消息可以通过一组“中间节点”在故障块中从源发送到目的地。如果中央控制单元不可用,我们的方法需要全局故障信息。
{"title":"Adaptive and fault-tolerant routing with 100% node utilization for mesh multicomputer","authors":"Sheng-de Wang, Ming-Jer Tsai","doi":"10.1109/ICPADS.1998.741099","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741099","url":null,"abstract":"We propose an adaptive and deadlock-free routing algorithm to tolerate irregular faulty patterns using two virtual channels per physical link. It can improve the node utilization up to 100%. When a node becomes faulty or recovered, the central control unit constructs a directed path graph which is used for generating the intermediate nodes of the message path. Thus a message can be transmitted from sources or to destinations within faulty blocks via a set of \"intermediate nodes\". Our method requires the global failure information if the central control unit is not available.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132415371","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
A general broadcasting scheme for recursive networks with complete connection 具有完全连接的递归网络的通用广播方案
Gen-Huey Chen, Shien-Ching Hwang, M. Su, Dyi-Rong Duh
A recursive network can be constructed with basic building blocks in a recursive manner. For example the hypercube is a recursive network because an n-dimensional hypercube consists of two (n-1)-dimensional hypercubes. A recursive network is said to be with complete connection if the subnetwork that constitute it are connected as a complete graph. A general broadcasting scheme is proposed for recursive networks with complete connection. The scheme is simple, efficient, and easy to be implemented. Moreover, no redundant message will be generated. Four networks: WK-recursive networks, hypercomplete networks, hypernet networks, and star networks, are taken as examples to show the effectiveness of the scheme.
递归网络可以用基本的构建块以递归的方式构建。例如,超立方体是一个递归网络,因为一个n维超立方体由两个(n-1)维超立方体组成。如果构成递归网络的子网以完全图的形式相连,则递归网络是完全连通的。针对完全连通的递归网络,提出了一种通用的广播方案。该方案简单、高效、易于实现。而且,不会产生多余的消息。以wk -递归网络、超完全网络、超网络和星型网络四种网络为例,验证了该方案的有效性。
{"title":"A general broadcasting scheme for recursive networks with complete connection","authors":"Gen-Huey Chen, Shien-Ching Hwang, M. Su, Dyi-Rong Duh","doi":"10.1109/ICPADS.1998.741051","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741051","url":null,"abstract":"A recursive network can be constructed with basic building blocks in a recursive manner. For example the hypercube is a recursive network because an n-dimensional hypercube consists of two (n-1)-dimensional hypercubes. A recursive network is said to be with complete connection if the subnetwork that constitute it are connected as a complete graph. A general broadcasting scheme is proposed for recursive networks with complete connection. The scheme is simple, efficient, and easy to be implemented. Moreover, no redundant message will be generated. Four networks: WK-recursive networks, hypercomplete networks, hypernet networks, and star networks, are taken as examples to show the effectiveness of the scheme.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133005098","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
Significant message precedence in object-based systems 在基于对象的系统中重要的消息优先级
Katsuya Tanaka, T. Enokido, H. Higaki, M. Takizawa
Distributed applications are realized by cooperation of objects. A state of the object depends on in what order the object exchanges request and response messages and computes requests. In this paper, we newly define a significantly precedent order of messages based on a conflicting relation among requests. The objects can be mutually consistent if the objects take messages in the significantly precedent order. We discuss a protocol which supports the significantly ordered delivery of request and response messages. Here, an object vector is newly proposed to significantly order messages.
分布式应用是通过对象间的协作来实现的。对象的状态取决于对象交换请求和响应消息以及计算请求的顺序。在本文中,我们基于请求间的冲突关系,重新定义了一个显著的消息优先顺序。如果对象以显著的优先顺序接收消息,则对象可以相互一致。我们讨论了一个支持请求和响应消息的有序传递的协议。在这里,新提出了一个对象向量来显著排序消息。
{"title":"Significant message precedence in object-based systems","authors":"Katsuya Tanaka, T. Enokido, H. Higaki, M. Takizawa","doi":"10.1109/ICPADS.1998.741083","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741083","url":null,"abstract":"Distributed applications are realized by cooperation of objects. A state of the object depends on in what order the object exchanges request and response messages and computes requests. In this paper, we newly define a significantly precedent order of messages based on a conflicting relation among requests. The objects can be mutually consistent if the objects take messages in the significantly precedent order. We discuss a protocol which supports the significantly ordered delivery of request and response messages. Here, an object vector is newly proposed to significantly order messages.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130253625","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
An efficient thread architecture for a distributed shared memory on symmetric multiprocessor clusters 对称多处理器集群上分布式共享内存的高效线程体系结构
Jyh-Biau Chang, Y. Tsai, C. Shieh, P. Chung
The purpose of the paper is to demonstrate an efficient thread architecture for a distributed shared memory (DSM) system on symmetric multiprocessor (SMP) clusters. For DSM systems on SMP, how to utilize the processors efficiently without wasting available computational power is a major issue. We discuss three approaches that use the process, the kernel level thread, and the user level thread to map application threads onto execution entities respectively. Considering the advantages and disadvantages of each method, we construct our thread package by combining both the user level thread and the kernel level thread. User level threads correspond to application threads and kernel level threads schedule these user level threads across multiple processors. Threads are light weighted and can be migrated in our thread package. With this thread architecture, our DSM system performs well in elementary experiments.
本文的目的是为对称多处理器(SMP)集群上的分布式共享内存(DSM)系统展示一种高效的线程体系结构。对于基于SMP的DSM系统,如何有效地利用处理器而不浪费可用的计算能力是一个主要问题。我们讨论了三种方法,分别使用进程、内核级线程和用户级线程将应用程序线程映射到执行实体。考虑到每种方法的优缺点,我们通过结合用户级线程和内核级线程来构建线程包。用户级线程对应于应用程序线程,内核级线程跨多个处理器调度这些用户级线程。线程是轻量级的,可以在我们的线程包中迁移。在此线程架构下,我们的DSM系统在初步实验中表现良好。
{"title":"An efficient thread architecture for a distributed shared memory on symmetric multiprocessor clusters","authors":"Jyh-Biau Chang, Y. Tsai, C. Shieh, P. Chung","doi":"10.1109/ICPADS.1998.741172","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741172","url":null,"abstract":"The purpose of the paper is to demonstrate an efficient thread architecture for a distributed shared memory (DSM) system on symmetric multiprocessor (SMP) clusters. For DSM systems on SMP, how to utilize the processors efficiently without wasting available computational power is a major issue. We discuss three approaches that use the process, the kernel level thread, and the user level thread to map application threads onto execution entities respectively. Considering the advantages and disadvantages of each method, we construct our thread package by combining both the user level thread and the kernel level thread. User level threads correspond to application threads and kernel level threads schedule these user level threads across multiple processors. Threads are light weighted and can be migrated in our thread package. With this thread architecture, our DSM system performs well in elementary experiments.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114422626","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
Interval algebra for spatio-temporal composition of distributed multimedia objects 分布式多媒体对象时空组成的区间代数
T. Shih, A. Y. Chang, Hwei-Jen Lin, Shwu-Huey Yen, Chuan-Feng Chiu
Relations among temporal intervals can be used to model time dependent objects. The extension of temporal relation results in many researches related to the spatio-temporal modeling of distributed objects. We propose a fast mechanism for temporal relation compositions. A temporal transitive closure table is derived, and an interval-based temporal relation algebraic system is constructed. Thus, we propagate the time constraints of arbitrary two objects across long distances n by linear time. A set of algorithms is proposed to derive reasonable relations between intervals. Possible conflicts in the user specification are detected and eliminated. The algorithms are extended for time-based media in an arbitrary n-dimensional space. The contributions of these algorithms and the interval algebra system can be used to detect and eliminate time conflicts, to generate the schedule and layout of multimedia presentations, to model interval-based synchronization specifications, to analyze the distributed real-time playout, to denote the semantics of natural language sentence tense, and to capture the temporal semantics among distributed multimedia objects.
时间间隔之间的关系可以用来建模时间依赖对象。时间关系的扩展导致了许多与分布式对象的时空建模相关的研究。我们提出了一种快速的时间关系合成机制。导出了一个时间传递闭包表,构造了一个基于区间的时间关系代数系统。因此,我们将任意两个对象的时间约束以线性时间传播到n个长距离上。提出了一套推导区间间合理关系的算法。检测并消除用户规范中可能存在的冲突。将该算法扩展到任意n维空间中的基于时间的媒体。这些算法和区间代数系统的贡献可以用于检测和消除时间冲突,生成多媒体呈现的调度和布局,建模基于区间的同步规范,分析分布式实时播放,表示自然语言句子时态的语义,以及捕获分布式多媒体对象之间的时间语义。
{"title":"Interval algebra for spatio-temporal composition of distributed multimedia objects","authors":"T. Shih, A. Y. Chang, Hwei-Jen Lin, Shwu-Huey Yen, Chuan-Feng Chiu","doi":"10.1109/ICPADS.1998.741088","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741088","url":null,"abstract":"Relations among temporal intervals can be used to model time dependent objects. The extension of temporal relation results in many researches related to the spatio-temporal modeling of distributed objects. We propose a fast mechanism for temporal relation compositions. A temporal transitive closure table is derived, and an interval-based temporal relation algebraic system is constructed. Thus, we propagate the time constraints of arbitrary two objects across long distances n by linear time. A set of algorithms is proposed to derive reasonable relations between intervals. Possible conflicts in the user specification are detected and eliminated. The algorithms are extended for time-based media in an arbitrary n-dimensional space. The contributions of these algorithms and the interval algebra system can be used to detect and eliminate time conflicts, to generate the schedule and layout of multimedia presentations, to model interval-based synchronization specifications, to analyze the distributed real-time playout, to denote the semantics of natural language sentence tense, and to capture the temporal semantics among distributed multimedia objects.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116170291","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
An efficient multi-sampling strategy for interactive display in a video-on-demand server 视频点播服务器中交互式显示的高效多采样策略
Chien I. Lee, Ye-In Chang, Wei-Pang Yang
One of the most important challenges in a video-on-demand system is to support interactive browsing functions such as fast forward and fast backward. There are several possible approaches to implementing these functions which require additional resources. Although the segment-sampling strategy proposed by Chen et al. (1995) can support browsing at any desired speed without any additional resource, this strategy only considers the display of a single continuous object at a time. In this paper, we propose a new strategy, called the multi-sampling strategy, which generalizes the approach of the segment-sampling strategy so that it can support continuous display of multiple objects at different display speed rates, simultaneously, without any additional resource.
视频点播系统最重要的挑战之一是支持交互式浏览功能,如快进快退。实现这些功能有几种可能的方法,但需要额外的资源。Chen et al.(1995)提出的分段采样策略虽然可以在不增加任何资源的情况下支持任意速度的浏览,但该策略一次只考虑单个连续对象的显示。在本文中,我们提出了一种新的策略,称为多采样策略,它推广了片段采样策略的方法,使其能够在不增加任何资源的情况下,以不同的显示速率同时支持多个对象的连续显示。
{"title":"An efficient multi-sampling strategy for interactive display in a video-on-demand server","authors":"Chien I. Lee, Ye-In Chang, Wei-Pang Yang","doi":"10.1109/ICPADS.1998.741089","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741089","url":null,"abstract":"One of the most important challenges in a video-on-demand system is to support interactive browsing functions such as fast forward and fast backward. There are several possible approaches to implementing these functions which require additional resources. Although the segment-sampling strategy proposed by Chen et al. (1995) can support browsing at any desired speed without any additional resource, this strategy only considers the display of a single continuous object at a time. In this paper, we propose a new strategy, called the multi-sampling strategy, which generalizes the approach of the segment-sampling strategy so that it can support continuous display of multiple objects at different display speed rates, simultaneously, without any additional resource.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121913462","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
An effective cache-index forwarding over wireless network for the World-Wide Web 在无线网络上为万维网提供有效的缓存索引转发
Hae-Sun Shin, Gyeong-Hun Kim, Se-Jin Hwang, A-Rum Jun, Gun-Hee Kim, Myong-Soon Park
Caching and prefetching are well-known solutions to the problem of long latency in both wired and wireless networks. Caching is prevalently used to reduce round-trips and network traffic. The prefetching and uploading-prefetching data from fixed hosts on a wired network and uploading to mobile hosts-in the base station for the WWW has been proposed to solve those problems and has shown high performance improvement. The performance of prefetching in the base station can be improved when the base station has the caching information of mobile hosts. Cache-index forwarding can be used to let the base station see information of caching on mobile hosts. Here we propose a method named "CINDEX: Cache-Index Forwarding per Document for the WWW", which sends the information of caching data on mobile hosts per document to the base station to eliminate unessential data prefetching and uploading.
缓存和预取是有线和无线网络中解决长延迟问题的众所周知的解决方案。缓存通常用于减少往返和网络流量。为了解决这些问题,提出了在有线网络上从固定主机上预取数据并上传到移动主机的WWW基站预取和上传方法,并取得了较好的性能改进。当基站具有移动主机的缓存信息时,可以提高基站预取的性能。缓存索引转发可以让基站看到移动主机上的缓存信息。本文提出一种名为“CINDEX: Cache-Index Forwarding per Document for the WWW”的方法,将移动主机上每个文档缓存数据的信息发送到基站,消除不必要的数据预取和上传。
{"title":"An effective cache-index forwarding over wireless network for the World-Wide Web","authors":"Hae-Sun Shin, Gyeong-Hun Kim, Se-Jin Hwang, A-Rum Jun, Gun-Hee Kim, Myong-Soon Park","doi":"10.1109/ICPADS.1998.741131","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741131","url":null,"abstract":"Caching and prefetching are well-known solutions to the problem of long latency in both wired and wireless networks. Caching is prevalently used to reduce round-trips and network traffic. The prefetching and uploading-prefetching data from fixed hosts on a wired network and uploading to mobile hosts-in the base station for the WWW has been proposed to solve those problems and has shown high performance improvement. The performance of prefetching in the base station can be improved when the base station has the caching information of mobile hosts. Cache-index forwarding can be used to let the base station see information of caching on mobile hosts. Here we propose a method named \"CINDEX: Cache-Index Forwarding per Document for the WWW\", which sends the information of caching data on mobile hosts per document to the base station to eliminate unessential data prefetching and uploading.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124195747","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
PANDA: ring-based multiprocessor system using new snooping protocol 熊猫:基于环的多处理机系统,采用新的窥探协议
S. Chung, S. Jhang, C. Jhon
The PANDA is a ring-based Cache Coherent Non-Uniform Memory Access (CC-NUMA) multiprocessor system under implementation at the Seoul National University. Its main goal is to ameliorate the data miss latency by using the unidirectional point-to-point interconnection network. We introduce the PANDA architecture and present a new snooping protocol for this system. We evaluate the performance of the PANDA for a small to medium scale multiprocessor system using analytical models and a program-driven simulator. We compare the proposed system to other alternatives of point-to-point connected machines, such as the Express Ring and full map directory based system. The simulation results show up to 29% performance improvement against the Express Ring. They also show that the PANDA performs no worse than the full map directory based system, which has the additional hardware costs for the directory management.
PANDA是首尔国立大学正在实施的基于环的高速缓存一致非统一存储器访问(CC-NUMA)多处理器系统。它的主要目标是利用单向点对点互连网络来改善数据丢失延迟。介绍了该系统的PANDA架构,并提出了一种新的窥探协议。我们使用分析模型和程序驱动模拟器来评估PANDA在中小规模多处理器系统中的性能。我们将提出的系统与其他点对点连接机器的替代方案进行比较,例如快速环和基于全地图目录的系统。仿真结果表明,与快速环相比,该方法的性能提高了29%。它们还表明,PANDA的性能并不比基于完整映射目录的系统差,后者在目录管理方面有额外的硬件成本。
{"title":"PANDA: ring-based multiprocessor system using new snooping protocol","authors":"S. Chung, S. Jhang, C. Jhon","doi":"10.1109/ICPADS.1998.741012","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741012","url":null,"abstract":"The PANDA is a ring-based Cache Coherent Non-Uniform Memory Access (CC-NUMA) multiprocessor system under implementation at the Seoul National University. Its main goal is to ameliorate the data miss latency by using the unidirectional point-to-point interconnection network. We introduce the PANDA architecture and present a new snooping protocol for this system. We evaluate the performance of the PANDA for a small to medium scale multiprocessor system using analytical models and a program-driven simulator. We compare the proposed system to other alternatives of point-to-point connected machines, such as the Express Ring and full map directory based system. The simulation results show up to 29% performance improvement against the Express Ring. They also show that the PANDA performs no worse than the full map directory based system, which has the additional hardware costs for the directory management.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127975665","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
A model of mobile agent services enhanced for resource restrictions and security 针对资源限制和安全性增强的移动代理服务模型
Tomoya Taka, T. Mizuno, Takashi Watanabe
Mobile agent technologies are becoming popular as an efficient way to access network resources. Because an application using mobile agents has some unique problems caused by frequent creation, migration and disappearance of mobile agents, a mobile agent platform has to provide not only agents and their execution engines but some functions and mechanisms which are specialized to mobile agent systems. We discuss the practical problems occurring in mobile agent environments, that is, agent controllability, resource restrictions and security. To solve these problems, we propose a mobile agent platform, called SFM (Secured Floating Market) model. This model fulfils the agent controllability by agent control parameters and has the measures against the resource restrictions such as location of resources and agents, processing capability and condition of load. Besides, this model guarantees some suitable security strength levels for flexible execution of various services and user requirements. We implement the prototype of this model using Aglets.
移动代理技术作为一种访问网络资源的有效方式正日益流行。由于移动代理的频繁创建、迁移和消失会给应用程序带来一些独特的问题,因此移动代理平台不仅需要提供代理及其执行引擎,还需要提供一些移动代理系统特有的功能和机制。我们讨论了在移动代理环境中出现的实际问题,即代理的可控性、资源限制和安全性。为了解决这些问题,我们提出了一个移动代理平台,称为SFM (Secured Floating Market)模型。该模型通过智能体控制参数来实现智能体的可控性,并对资源和智能体的位置、处理能力和负载条件等资源限制采取措施。此外,该模型还保证了一些合适的安全强度级别,以灵活执行各种业务和用户需求。我们使用Aglets实现了该模型的原型。
{"title":"A model of mobile agent services enhanced for resource restrictions and security","authors":"Tomoya Taka, T. Mizuno, Takashi Watanabe","doi":"10.1109/ICPADS.1998.741081","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741081","url":null,"abstract":"Mobile agent technologies are becoming popular as an efficient way to access network resources. Because an application using mobile agents has some unique problems caused by frequent creation, migration and disappearance of mobile agents, a mobile agent platform has to provide not only agents and their execution engines but some functions and mechanisms which are specialized to mobile agent systems. We discuss the practical problems occurring in mobile agent environments, that is, agent controllability, resource restrictions and security. To solve these problems, we propose a mobile agent platform, called SFM (Secured Floating Market) model. This model fulfils the agent controllability by agent control parameters and has the measures against the resource restrictions such as location of resources and agents, processing capability and condition of load. Besides, this model guarantees some suitable security strength levels for flexible execution of various services and user requirements. We implement the prototype of this model using Aglets.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115594715","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
Fast mutual exclusion algorithms using read-modify-write and atomic read/write registers 使用读-修改-写和原子读/写寄存器的快速互斥算法
Ting-Lu Huang
Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last algorithm is shown to be optimal in minimizing the number of remote memory accesses required in a resource busy period. Remote memory access is the key factor of memory access bottleneck in large shared-memory multiprocessors. The algorithm is particularly suitable in such systems for applications with small critical sections and frequent resource requests.
按顺序提出了三种使用读-修改-写和原子读/写寄存器的快速互斥算法,并逐一进行了改进。最后一种算法在最小化资源繁忙期间所需的远程内存访问次数方面是最优的。远程内存访问是大型共享内存多处理器内存访问瓶颈的关键因素。该算法特别适用于临界区小、资源请求频繁的应用系统。
{"title":"Fast mutual exclusion algorithms using read-modify-write and atomic read/write registers","authors":"Ting-Lu Huang","doi":"10.1109/ICPADS.1998.741084","DOIUrl":"https://doi.org/10.1109/ICPADS.1998.741084","url":null,"abstract":"Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last algorithm is shown to be optimal in minimizing the number of remote memory accesses required in a resource busy period. Remote memory access is the key factor of memory access bottleneck in large shared-memory multiprocessors. The algorithm is particularly suitable in such systems for applications with small critical sections and frequent resource requests.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115463938","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
期刊
Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1