7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.最新文献

Proxy placement in coordinated en-route transcoding caching for tree networks 树形网络中协调路由转码缓存中的代理放置

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-07-07 DOI: 10.1109/ICPADS.2004.31

Keqiu Li, Hong Shen

引用次数: 0

Distributed server selection with imprecise state for replicated server group 复制服务器组的分布式服务器选择状态不精确

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300460

Heng Chang, W. Jia, Ling Zhang

引用次数: 3

Strongly regular graphs associated with bent functions 与弯曲函数相关的强正则图

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300509

Tayuan Huang, Kuei-Hung You

引用次数: 4

Identifying transcriptional regulatory sites in the human genome using an integrated computation 利用集成计算识别人类基因组中的转录调控位点

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300550

Hsien-Da Huang, Jorng-Tzong Horng, Yi-Ming Sun, A. Tsou, Shir-Ly Huang

引用次数: 0

Optimal adaptive fault diagnosis of cubic Hamiltonian graphs 三次哈密顿图最优自适应故障诊断

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300475

Toru Araki

引用次数: 5

Dynamic update of shortest path tree in OSPF 动态更新OSPF最短路径树

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300451

Bin Xiao, Jiannong Cao, Qingfeng Zhuge, Z. Shao, E. Sha

引用次数: 13

Performance of parallel logic event simulation on PC-cluster 并行逻辑事件仿真在pc集群上的性能研究

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300518

T. Le, J. Rejeb

{"title":"Performance of parallel logic event simulation on PC-cluster","authors":"T. Le, J. Rejeb","doi":"10.1109/ISPAN.2004.1300518","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300518","url":null,"abstract":"PC-cluster is becoming more and more popular in many scientific and engineering applications, but not in electronic design areas. One of the reasons that parallel simulations have not been popularized is due to the high cost of frequent communications of small messages. Several simulation techniques have been aggressively studied and developed in the past ten years. These studies mostly focused on parallel VHDL simulation. In this paper, we show the effects of PC-cluster communication latencies on the performance of parallel discrete event simulation. We performed the experiments with two equivalent 8-node PC-cluster systems, one with regular Ethernet cards and one with Myrinet network cards. In order to study the effects of communication costs on the overall performance of parallel simulation algorithms, our study concentrates on fundamental techniques of discrete parallel event simulation scheme. The simulation processes are synchronized by the time warp mechanism and the problem domain is partitioned for best parallel performance. The speedup results show that although current PC-cluster technology is ready for parallel logic simulator, even for high-demanding communication applications, new algorithms that can avoid or minimize the computational rolling-back must be developed in order to catch up the rapid advancement of microprocessor technologies.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130542792","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

Constructing multiple light multicast trees in WDM optical networks WDM光网络中多个轻组播树的构建

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300525

W. Liang

{"title":"Constructing multiple light multicast trees in WDM optical networks","authors":"W. Liang","doi":"10.1109/ISPAN.2004.1300525","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300525","url":null,"abstract":"Multicast routing is a fundamental problem in any telecommunication network. We address the multicast issue in a WDM optical network without wavelength conversion capability. To realize a multicast request in such network, it is required to establish multiple light multicast trees (MLMT) sometimes due to the fact that the requested network resources are being occupied by other routing traffic and therefore it is impossible to establish a single light multicast tree for the request. In this paper we first propose a multiple light multicast tree model. We then show the MLMT is NP-hard, and devise an approximation algorithm for it which takes 0((kn)/sup 1//spl epsi//|D|/sup 2//spl epsi// + kn + km) time and delivers an approximation solution within 0(|D|/sup /spl epsi//) times of the optimal, where n, m, and k are the numbers of nodes, links, and wavelengths in the network, D is the set of destination nodes and e is constant, 0 < e /spl les/ 1. We finally extend the problem further with the end-to-end path delay is bounded by an integer /spl Delta/, and we call this latter problem as the multiple delay-constrained light multicast tree problem (MDCLMT), for which we propose two approximation algorithms with the performance ratios of |D|. One of the proposed algorithms takes 0(km|D|/spl Delta/ + |D|/sup 2/m/spl Delta/) time and the path delay is strictly met; and another takes O(kmn//spl epsi/ + |D|n/sup 2/) time and the path delay is no more than (1 + /spl epsi/)/spl Delta/, where /spl epsi/ is constant with 0 < /spl epsi/ /spl les/ 1.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134099871","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

Tree-like hierarchical model for distributed micro-security system 分布式微安全系统的树状分层模型

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300543

Qin Zhang, Hai Jin, Chuanjiang Yi, Liping Pang

引用次数: 1

A new method for independent task scheduling in nonlinearly DAG clustering 非线性DAG聚类中独立任务调度的新方法

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI: 10.1109/ISPAN.2004.1300479

Qiang-Sheng Hua, Zhi-gang Chen, F. Lau

引用次数: 3