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

Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)最新文献

筛选
英文 中文
Using SADTs to support irregular computational problems 使用sadt支持不规则计算问题
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778961
J. M. Nash
{"title":"Using SADTs to support irregular computational problems","authors":"J. M. Nash","doi":"10.1109/ISPAN.1999.778961","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778961","url":null,"abstract":"There are well defined methods for supporting regular problems with scalable performance, typified by the HPF language and the BSP model. Less well understood is the solution of more irregular problems, supporting complex shared data structures and task dependencies, and typically requiring dynamic load balancing to sustain high performance. It is demonstrated how the use of Shared Abstract Data Types (SADTs), together with an extended BSP cost model, can support irregular problems in a structured manner An SADT is an extension of a serial ADT which allows the concurrent invocation of its methods. A number of SADTs are used to implement a solution of the travelling salesman problem on the Cray T3D machine, and a description of the restructuring of a parallel CFD code using SADTs is provided, with initial results given for the Cray T3E.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130714938","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
Another measure for the lexicographically first maximal subgraph problems and its threshold value on a random graph 另一种字典顺序第一最大子图问题的度量及其在随机图上的阈值
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778963
Ryuhei Uehara
{"title":"Another measure for the lexicographically first maximal subgraph problems and its threshold value on a random graph","authors":"Ryuhei Uehara","doi":"10.1109/ISPAN.1999.778963","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778963","url":null,"abstract":"We investigate structural parameters of a graph that express the boundary of the parallel complexity of the lexicographically first maximal independent set (LFMIS) problem. As a measure, we introduce the longest directed path length (LDPL), that is better than previously known one. The parallel complexity of the LFMIS problem on a graph gradually increases as the value measured on the graph grows. The LFMIS problem on a graph of LDPL O(log/sup k/ n) is in NC/sup k+1/, and the problem on a graph of LDPL /spl Theta/(n/sup /spl epsiv//) is P-complete. We also investigate the limit of the measure. We construct a kind of the lexicographically first maximal subgraph problems such that the problem is P-complete even if the LDPL of the input graph is restricted to 1. Finally, we discuss the probability that a random graph has LDPL and show that its threshold value is 1/n. This implies that a random graph of which each edge exists with probability p has LDPL /spl Theta/(np) with high probability. The result also show the limit of the LDPL on the average case.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"14 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114117138","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
The design and simulation of a hybrid replication control protocol 混合复制控制协议的设计与仿真
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778941
Wanlei Zhou, R. Holmes
{"title":"The design and simulation of a hybrid replication control protocol","authors":"Wanlei Zhou, R. Holmes","doi":"10.1109/ISPAN.1999.778941","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778941","url":null,"abstract":"Replica control protocols in distributed database systems are responsible for the management and maintenance of replicated (redundant) data. Maintaining replicated data improves performance and increases availability. Keeping the replicated data consistent and available during the presence of failures can however become quite difficult. The paper presents the design of a hybrid replica control protocol that attempts to maximise availability and minimise communication overhead, by combining the advantages of two common replica control protocols into one. The protocol was simulated using SimJava, a process based discrete event simulation package. The results from the simulations showed that not only did the hybrid algorithm maintain a high level of availability, it did so while minimising communication overheads.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"333 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114386711","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
Efficient algorithms for fault-tolerant communication in optical WDM networks 光WDM网络中容错通信的有效算法
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778927
Hong Shen, Keqin Li, Y. Pan, Si-Qing Zheng
{"title":"Efficient algorithms for fault-tolerant communication in optical WDM networks","authors":"Hong Shen, Keqin Li, Y. Pan, Si-Qing Zheng","doi":"10.1109/ISPAN.1999.778927","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778927","url":null,"abstract":"Addresses the problem of efficient communication in unreliable multi-hop optical networks supported by wavelength division multiplexing (WDM). We first define a new cost model for routing in (optical) WDM networks that is more general and realistic than the existing models. Our model takes into consideration not only the cost of wavelength access and conversion but also the cost for wavelength switching when several optical channels of the same wavelength arrive at the same node. We then propose a set of efficient algorithms in both reliable and unreliable WDM networks on the new cost model respectively for each of three important communication patterns-multiple point-to-point routing, multicast and multiple multicast.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116094918","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
Meta-QoS performance of earliest-deadline-first and rate-monotonic scheduling of smoothed video data in a client-server environment 客户端-服务器环境下平滑视频数据的最早截止日期优先和速率单调调度的元qos性能
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778948
K. Tsoi, Yu-Kwong Kwok
{"title":"Meta-QoS performance of earliest-deadline-first and rate-monotonic scheduling of smoothed video data in a client-server environment","authors":"K. Tsoi, Yu-Kwong Kwok","doi":"10.1109/ISPAN.1999.778948","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778948","url":null,"abstract":"In this paper we present an extensive performance study of two modified EDF and RM scheduling algorithms which are enhanced to provide quality of service (QoS) guarantees for smoothed video data. With a probabilistic definition of QoS, we incorporate admission control conditions into the two algorithms. Furthermore, we also include a counter-based scheduling module as the core scheduling mechanism which adaptively adjusts the actual QoS levels assigned to requests. Our theoretical analysis of the two enhanced algorithms, called QEDF and QRM, shows that the QRM algorithm is more robust than the QEDF algorithm for different workload and utilization conditions. We also propose to use a new metric called meta-QoS to quantify the overall performance of a packet scheduler given a set of simultaneous requests. In our experiments, we find that the QRM algorithm can sustain a rather stable level of meta-QoS even when the workload and utilization levels are increased. On the other hand, the QEDF algorithm is found to be less desirable for a high level of utilization and a large number of requests.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124227637","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
Object-oriented design of adaptive multicast communications 面向对象的自适应组播通信设计
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778916
Weiming Zhang, W. Jia
{"title":"Object-oriented design of adaptive multicast communications","authors":"Weiming Zhang, W. Jia","doi":"10.1109/ISPAN.1999.778916","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778916","url":null,"abstract":"Multicast (group) communications have been widely recognized by current research and industry. Multicast is very useful for various network applications such as distributed (replicated) database, video/audio conference, information distribution and server locations etc. But design and implementation of such multicast communication systems in networks are complicated tasks, especially when quality of service (QoS) of applications such as real time and reliability are desired. In order to quickly design and implement multicast communication, good tools are crucial and must be facilitated. The paper presents a novel object oriented (OO) QoS driven approach for the quick design and prototyping of multicast communication systems under certain QoS requirements, for multicast message transmission and receptions such as real time, total ordering, atomicity and fault tolerance etc.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124494466","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
Improving performance of adaptive media access control protocols for high-density wireless networks 改进高密度无线网络中自适应媒体访问控制协议的性能
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778958
A. Lim, K. Mok
{"title":"Improving performance of adaptive media access control protocols for high-density wireless networks","authors":"A. Lim, K. Mok","doi":"10.1109/ISPAN.1999.778958","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778958","url":null,"abstract":"The problems of intermittent disconnection, high error rate and collision in high-density wireless networks cause degradation in the performance of wireless media access control protocols, such as slotted ALOHA Time Division Multiple Access (slotted ALOHA/TDMA) and Direct Sequence Code Division Multiple Access (DS/CDMA). We propose adaptive techniques for improving performance of media access protocols through awareness of the mobile communication environment. These techniques involve detection of intermittent disconnection, high error rates, and collisions. Upon detection and notification of these conditions by snooping devices, the media access control layer adapts its operation and synchronization accordingly to reduce delay and loss of bandwidth. Results from our simulation studies show that adaptive TDMA improves performance by as much as 12 times over basic TDMA and adaptive CDMA improves by as much as 4 times over basic CDMA in wireless network with high population cells. Overall, adaptive CDIMA still performs better than adaptive TDMA by about 4 times.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122542303","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
Distributed clustering for ad hoc networks 用于自组织网络的分布式集群
Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) Pub Date : 1999-06-23 DOI: 10.1109/ISPAN.1999.778957
S. Basagni
{"title":"Distributed clustering for ad hoc networks","authors":"S. Basagni","doi":"10.1109/ISPAN.1999.778957","DOIUrl":"https://doi.org/10.1109/ISPAN.1999.778957","url":null,"abstract":"A Distributed Clustering Algorithm (DCA) and a Distributed Mobility-Adaptive Clustering (DMAC) algorithm are presented that partition the nodes of a fully mobile network: (ad hoc network) into clusters, this giving the network a hierarchical organization. Nodes are grouped by following a new weight-based criterion that allows the choice of the nodes that coordinate the clustering process based on node mobility-rebated parameters. The DCA is suitable for clustering \"quasistatic\" ad hoc networks. It is easy to implement and its time complexity is proven to be bounded by a network parameter that depends on the topology of the network rather than on its size, i.e., the invariant number of the network nodes. The DMAC algorithm adapts to the changes in the network topology due to the mobility of the nodes, and it is thus suitable for any mobile environment. Both algorithms are executed at each node with the sole knowledge of the identity of the one hop neighbors, and induce on the network the same clustering structure.","PeriodicalId":157641,"journal":{"name":"Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123607039","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}
引用次数: 1162
首页 上一页
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学术官方微信
小红书