Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献

筛选
英文 中文
A new class of combinatorial linear codes for multiple-error-correction 一类新的多重纠错组合线性码
F. Jin, F. Hu, Hong Wen
{"title":"A new class of combinatorial linear codes for multiple-error-correction","authors":"F. Jin, F. Hu, Hong Wen","doi":"10.1109/PDCAT.2003.1236440","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236440","url":null,"abstract":"By means of block design theory of combinatorial mathematics, a new class of linear block codes called bilateral checking codes is constructed. Since in this kind of bilateral checking codes not only all the information bits can be checked by check bits, but also the check bits can be examined by information bits, the error correcting capabilities can thus be effectively enhanced.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115433327","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
rtORB: a real-time CORBA prototype rtORB:实时CORBA原型
Peng Jian, Liu Jin-de, Tan Hao, Luo Zhi-gang
{"title":"rtORB: a real-time CORBA prototype","authors":"Peng Jian, Liu Jin-de, Tan Hao, Luo Zhi-gang","doi":"10.1109/PDCAT.2003.1236412","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236412","url":null,"abstract":"A real-time CORBA prototype called rtORB is presented. The key components of rtORB are mainly described. A platform dependent layer is introduced to enhance the portability of ORB. The scheduling service proposed in real-time CORBA specification is extended to support dynamic scheduling. An explicit binding model is used to establish predictable communication channel. A delayered real-time POA (portable object adapter) is designed to minimize the overhead of demultiplexing and dispatching incoming requests and to avoid priority inversion. Several methods used to optimize its performance are discussed deeply. The real-time performance experiments show that rtORB is capable of supporting real-time application.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124284349","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 application of multicriterion satisfactory optimization in computer networks design 多准则满意优化在计算机网络设计中的应用
Tan Xian-hai, J. Weidong, Zhao Duo
{"title":"The application of multicriterion satisfactory optimization in computer networks design","authors":"Tan Xian-hai, J. Weidong, Zhao Duo","doi":"10.1109/PDCAT.2003.1236386","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236386","url":null,"abstract":"The computer networks design is a nonlinear combinatorial optimization problem with constraint set identical to that of the multiple choice multiconstraint knapsack problem, which is known to be NP-complete. We present a new approach in which a multicriterion satisfactory optimization is used in the computer networks design. The optimal computing model is proposed. The satisfactory rate function of the criteria, which represents the importance of performance specification, and the synthesis satisfactory rate function representing the optimization are designed. An improved genetic algorithm is used for optimization computing. Computational experience shows that this method is efficient and effective.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117339081","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
A model for the integration of buffer management and packet scheduling 一个缓冲区管理和包调度集成的模型
Wenjiang Zhou, Chuang Lin, Fengyuan Ren
{"title":"A model for the integration of buffer management and packet scheduling","authors":"Wenjiang Zhou, Chuang Lin, Fengyuan Ren","doi":"10.1109/PDCAT.2003.1236251","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236251","url":null,"abstract":"Buffer management and packet scheduling are the main features of resource management and the key mechanisms for QoS (quality of service) provision. We propose a novel model for the integration of buffer management and packet scheduling. The model makes the packet dropping and scheduling decisions in one step through a synthetic objective function considering loss rate, delay and bandwidth simultaneously. The simulation study shows this model provides not only loss and delay proportional differentiation, decoupling of delay and bandwidth, but also the best synthetic performance fairness.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121096209","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
Adaptive creation of network applications by a patchwork application module 通过拼凑的应用程序模块自适应地创建网络应用程序
T. Otsuka, M. Matsuo, T. Suda
{"title":"Adaptive creation of network applications by a patchwork application module","authors":"T. Otsuka, M. Matsuo, T. Suda","doi":"10.1109/PDCAT.2003.1236252","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236252","url":null,"abstract":"The Ja-Net (Jack-in-the-Net) architecture creates network applications through interactions among application components called cyber entities (CEs). CEs establish relationships with other CEs and cooperatively provide applications with relationship partners. The strength of a relationship is the measure for the usefulness of the partner and adjusted based on the evaluation by users of the application. In Ja-Net, network applications are adaptively created through the formation of a group based on the strength of relationships between CEs (the grouping technique). Through simulations, we evaluate Ja-Net's adaptability and show the limitations of the grouping technique. To enhance its adaptability, we propose a group-patchwork technique, which develops better adapted groups by combining existing simpler groups, and evaluate its effectiveness by simulation. It is confirmed that the group-patchwork technique provides enough adaptability even when it faces a user preference change.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127439640","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 completely distributed architecture for cluster-based Web servers 用于基于集群的Web服务器的完全分布式体系结构
Du Zeng-Kai, Ju Jiu-bin
{"title":"A completely distributed architecture for cluster-based Web servers","authors":"Du Zeng-Kai, Ju Jiu-bin","doi":"10.1109/PDCAT.2003.1236349","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236349","url":null,"abstract":"While content-aware distribution policies getting more popular in cluster-based Web systems, they make the dispatching node a bottleneck. To achieve scalable server performance, we present a completely distributed architecture named CODA. In CODA, we employ both layer-4 and layer-7 Web switching techniques. While the front-end layer-4 switch distributes the client requests among the server nodes using some simple dispatching algorithm, the server nodes may forward the incoming request to another server node according to some content-aware policy. By eliminating the centralized dispatcher, CODA affords better scalability and fault tolerance. Moreover, we have implemented this architecture on the basis of Linux IP stack and evaluated its performance with trace-based workloads. Our performance results show it can achieve favorable throughput compared to existing architectures.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125551693","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
A scalable high performance network monitoring agent for CERNET 一个可扩展的高性能CERNET网络监控代理
Zhang Hui, Li Xing, Li Zimu
{"title":"A scalable high performance network monitoring agent for CERNET","authors":"Zhang Hui, Li Xing, Li Zimu","doi":"10.1109/PDCAT.2003.1236277","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236277","url":null,"abstract":"In a cost-effective way, collecting and analyzing data from such a nationwide operational network as China Education and Research Network (CERNET) is an increasingly challenging task. We present experience gained in designing and implementing a passive monitoring agent applicable to CERNET, which helps to cooperate not only with network intrusion detection system (IDS), network management system (NMS) for detecting and identifying signs of malicious activities, nonmalicious failures and other exceptional events in real-time, but provides anomaly information to accounting and billing system (ABS) so as to make it healthy. This agent is characterized by a high performance data collecting facility and a methodology of real-time data correlation and analysis. A customized agent can be deployed on a particular link of CERNET for monitoring network dynamically. We discuss how to conflate, correlate, associate and refine measurement data to discriminate anomalies such as DoS from normal traffic, and how to respond to the anomalies for the purpose of operational network's health. It concludes with experiences learned from the development and deployment of the agent and ongoing research work.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129744894","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
An object-oriented method for out-of-core parallel computations on cluster of workstations 面向对象的工作站集群核外并行计算方法
Jianqi Tang, Binxing Fang, Mingzeng Hu, Hongli Zhang
{"title":"An object-oriented method for out-of-core parallel computations on cluster of workstations","authors":"Jianqi Tang, Binxing Fang, Mingzeng Hu, Hongli Zhang","doi":"10.1109/PDCAT.2003.1236354","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236354","url":null,"abstract":"Many applications in different fields need to access large amounts of data. The difficulty of handling out-of-core data limits the performance of supercomputers. We first describe an out-of-core computation model on cluster of workstations. Then an object-oriented method is offered, which makes the out-of-core programs easier to write. Some optimal strategies, such as distribution of local array files, data sieving and prefetching, also make an improvement in the performance of out-of-core parallel computations.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128784858","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
An efficient parallel scheduling algorithm of dependent task graphs 一种高效的相关任务图并行调度算法
Mingsheng Shang, Shixin Sun, Qing-xian Wang
{"title":"An efficient parallel scheduling algorithm of dependent task graphs","authors":"Mingsheng Shang, Shixin Sun, Qing-xian Wang","doi":"10.1109/PDCAT.2003.1236372","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236372","url":null,"abstract":"Optimal scheduling of tasks of a directed acyclic graph (DAG) onto a set of processors is a strong NP-hard problem. Because list scheduling has shown good performance and is less difficult to design, it has been studied and used widely. We present a new list scheduling scheme to schedule tasks of a DAG onto a homogeneous multiprocessors system. The primary objective of this scheme is to minimize schedule length and scheduling time itself. We analyzed three typical list scheduling algorithms - MCP algorithm, ETF algorithm and BDCP algorithm, and find that they all cannot guarantee the earliest schedules of the CPNs. In this paper, we propose a better list scheduling algorithm based on critical path, and its time-complexity is O(pv/sup 2/). This algorithm always it is the most important purpose that schedule CPN as soon as it is a ready task, which makes the nodes that have the greatest influence to the scheduling length of the task graph be scheduled first. This greatly shortens the scheduling length of the task graph. We compare the performance of this algorithm with existing scheduling scheme through analysis and the result of experiments. The scheduling length generated by this algorithm is shorter than that of other scheduling algorithm.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126689343","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}
引用次数: 25
Routing in dynamic network based on the fuzzy knowledge exchange among multi-agents 基于多智能体间模糊知识交换的动态网络路由
Liu Hanbin, Wang Mingyi, Yao Shaowen, Zhou Mingtian
{"title":"Routing in dynamic network based on the fuzzy knowledge exchange among multi-agents","authors":"Liu Hanbin, Wang Mingyi, Yao Shaowen, Zhou Mingtian","doi":"10.1109/PDCAT.2003.1236258","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236258","url":null,"abstract":"Many existing routing mechanisms are awkward in a highly dynamic network environment. By proposing a cooperative model of multiagents based on fuzzy knowledge and a basal algorithm for routing computation, we apply a multiple mobile agent cooperating system to dynamic network routing. Some key factors of the system are discussed in the context. With the help of a simulative dynamic network and experiments, we analyze the performance-overhead characteristic of the system and make a comparison among cooperation strategies. The results show that the proposed theoretic model and algorithm are suitable for dynamic network routing and able to improve the response capability of the routing system.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129178009","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学术官方微信