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

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

筛选
英文 中文
An improved dynamic scheduling algorithm for multiprocessor real-time systems 一种改进的多处理器实时系统动态调度算法
Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2003-10-20 DOI: 10.1109/PDCAT.2003.1236397
Zhu Xiangbin, Tu Shiliang
{"title":"An improved dynamic scheduling algorithm for multiprocessor real-time systems","authors":"Zhu Xiangbin, Tu Shiliang","doi":"10.1109/PDCAT.2003.1236397","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236397","url":null,"abstract":"In the scheduling algorithms on multiprocessor real-time systems, the heuristic algorithm is an important algorithm and a known heuristic algorithm is myopic algorithm (K.Ramamritham, et. at., 1990). The performance of the myopic algorithm is greatly based on heuristic functions. We present an improved heuristic algorithm, which has a new heuristic function. The improved algorithm considers not only the deadlines and the resource requirements of a task, but also the processing time of the task. The most important metric for real-time scheduling algorithms is scheduling success ratio. To evaluate the effectiveness of the improved algorithm, we have done extensive simulation studies. The simulation results show that the scheduling success ratio of the improved heuristic algorithm is superior to that of myopic algorithm.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"104 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":"128199453","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
Web Ontology Language OWL and its description logic foundation Web本体语言OWL及其描述逻辑基础
Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2003-10-20 DOI: 10.1109/PDCAT.2003.1236278
Zuo Zhihong, Zhou Mingtian
{"title":"Web Ontology Language OWL and its description logic foundation","authors":"Zuo Zhihong, Zhou Mingtian","doi":"10.1109/PDCAT.2003.1236278","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236278","url":null,"abstract":"W3C Web Ontology Working Group have been developing the Web ontology language OWL, which is a semantic markup language for publishing and sharing ontologies on the semantic Web. OWL is designed as an extension of RDF/S (resource description framework/schemas) and is derived from the DAML+OIL Web Ontology Language. Its success will depend heavily on its underlying logic foundation, especially description logics (DLs), and reasoning services which can provide. An introduction to OWL and some discussions about relationships between OWL and its underlying description logic is described.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"120 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":"128344738","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}
引用次数: 26
A novel parallel turbo coding technique based on frame split and trellis terminating 一种新的基于帧分割和网格终止的并行turbo编码技术
Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2003-10-20 DOI: 10.1109/PDCAT.2003.1236452
Ke Wan, Qingchun Chen, P. Fan
{"title":"A novel parallel turbo coding technique based on frame split and trellis terminating","authors":"Ke Wan, Qingchun Chen, P. Fan","doi":"10.1109/PDCAT.2003.1236452","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236452","url":null,"abstract":"A new parallel turbo encoding and decoding technique is introduced. In this technique, a long information data frame is first divided into subblocks which are then encoded with trellis terminating and decoded by parallel multiple SISO modules. It is shown that, at a slight increase in hardware complexity and a slight loss in the transmission efficiency due to the extra terminating bits appended, the proposed scheme can effectively reduce the decoding delay, and at the same time achieve noticeably better error performance compared with the regular schemes, especially in high code rate situation.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"58 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":"134049953","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 automatic compiler for extracting inter-block parallelism 用于提取块间并行性的自动编译器
Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2003-10-20 DOI: 10.1109/PDCAT.2003.1236353
Liao Guodong, Zhang Defu, Han Jie
{"title":"An automatic compiler for extracting inter-block parallelism","authors":"Liao Guodong, Zhang Defu, Han Jie","doi":"10.1109/PDCAT.2003.1236353","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236353","url":null,"abstract":"We present an automatic parallelization scheme involving extracting inter-block parallelism within sequential programs, scheduling block graphs, and generating appropriate target codes for message passing multiprocessors. Compared with existing parallelization compilers, it is capable of exploiting more parallelism because potential parallelism existing within blocks is take into consideration.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"41 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":"134357706","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
TAGS and extended TAGS algorithm TAGS和扩展的TAGS算法
Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2003-10-20 DOI: 10.1109/PDCAT.2003.1236395
Zhang Jun-yan, Min Fan, Yang Guo-wei
{"title":"TAGS and extended TAGS algorithm","authors":"Zhang Jun-yan, Min Fan, Yang Guo-wei","doi":"10.1109/PDCAT.2003.1236395","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236395","url":null,"abstract":"In a distributed Web server system where tasks are not preemptible, the most important issue for improving quality of service (QoS) is how to realize fairness and reduce average slow down. We analyze TAGS (task assignment by guessing size) algorithm and put forward an algorithm named extended TAGS by integrating central queue algorithm and TAGS, together with its performance analysis, system parameter setting algorithm subject to fairness requirement, and optimal grouping method.","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":"129088304","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
A parallel approach to evidence combination on qualitative Markov trees 定性马尔可夫树证据组合的并行方法
Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2003-10-20 DOI: 10.1109/PDCAT.2003.1236357
X. Hong, Weiru Liu, K. Adamson
{"title":"A parallel approach to evidence combination on qualitative Markov trees","authors":"X. Hong, Weiru Liu, K. Adamson","doi":"10.1109/PDCAT.2003.1236357","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236357","url":null,"abstract":"Dempster's rule of evidence combination is computational expensive. We present a parallel approach to evidence combination on a qualitative Markov tree. Binarization algorithm transforms a qualitative Markov tree into a binary tree based on the computational workload in nodes for an exact implementation of evidence combination. A binary tree is then partitioned into clusters with each cluster being assigned to a processor in a parallel environment. The parallel implementation improves the computational efficiency of evidence combination.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"42 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":"128458520","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
Tradeoffs of DDoS solutions DDoS解决方案的权衡
Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2003-10-20 DOI: 10.1109/PDCAT.2003.1236287
Min Fan, Zhang Jun-yan, Li Wan-pei, Yang Guo-wei
{"title":"Tradeoffs of DDoS solutions","authors":"Min Fan, Zhang Jun-yan, Li Wan-pei, Yang Guo-wei","doi":"10.1109/PDCAT.2003.1236287","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236287","url":null,"abstract":"Distributed denial of service (DDoS) has become a serious threat to the Internet. Many schemes against DDoS attacks have been proposed, including ingress/egress filtering, IP traceback, authentication, and so on. We focus on tradeoffs of DDoS solutions. Three tradeoffs are considered, the first one is space, complexity, efficiency and robustness tradeoffs of these packet marking schemes; the second one is marking probability of node sampling scheme, the third one is timeout period of server for three-hand-shaking. Two schemes are suggested, one is combining node append scheme with node sampling scheme, the other is setting SYN timeout dynamically. Proper tradeoffs can be made using these schemes.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"271 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":"115983546","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
Comparative study of two GA based task allocation models in distributed computing system 分布式计算系统中基于遗传算法的两种任务分配模型的比较研究
Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2003-10-20 DOI: 10.1109/PDCAT.2003.1236344
D. P. Vidyarthi, A. Tripathi, B. K. Sarker, Kirti Rani
{"title":"Comparative study of two GA based task allocation models in distributed computing system","authors":"D. P. Vidyarthi, A. Tripathi, B. K. Sarker, Kirti Rani","doi":"10.1109/PDCAT.2003.1236344","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236344","url":null,"abstract":"Genetic algorithm has emerged as a successful tool for optimization problems. Previously, we proposed a task allocation model to maximize the reliability of a distributed computing system (DCS) using a genetic algorithm. Our objective is to use the same simple genetic algorithm to minimize the turnaround time of the task given to the DCS for execution and then to compare the resultant allocation with the allocation of maximal reliability as obtained by Vidyarthi et al. (2001). Comparisons of both the algorithms are made by illustrated examples and appropriate comments.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"29 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":"116353780","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
A fast algorithm for nonlinearity of Boolean function 布尔函数非线性的快速求解算法
Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2003-10-20 DOI: 10.1109/PDCAT.2003.1236405
Yu Weichi, He Dake
{"title":"A fast algorithm for nonlinearity of Boolean function","authors":"Yu Weichi, He Dake","doi":"10.1109/PDCAT.2003.1236405","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236405","url":null,"abstract":"Nonlinearity is an important index for a Boolean function to be used in stream cipher systems. We design fast algorithm for nonlinearity of Boolean function. Boolean addition used in this new algorithm instead of integer matrix multiplication used in ordinary ones, by which both time and space are saved.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"87 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":"114294449","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
A knowledge markup language and distributed theorem proving 一种知识标记语言和分布式定理证明
Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2003-10-20 DOI: 10.1109/PDCAT.2003.1236272
Zheng-Quan Xu, Jia-Bing Wang, Neng-Chao Wang
{"title":"A knowledge markup language and distributed theorem proving","authors":"Zheng-Quan Xu, Jia-Bing Wang, Neng-Chao Wang","doi":"10.1109/PDCAT.2003.1236272","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236272","url":null,"abstract":"We mainly focus on the following two issues: the knowledge and problems representation on the Web, and how a theorem-proving system can provide users on the Web with theorem-proving Web services. As to the first issue, we propose MSKML (many-sorted knowledge markup language) as the language for knowledge and problems representation on the Web; as to the second, the theorem-proving server provides Web users with theorem-proving services through the SOAP (simple object access protocol). When a client on the Web need the theorem-proving services, it represents the problem as a XML (extensible markup language) file conforming to the MSKML DTD (document type definition) and sends a SOAP request message including the XML file to the theorem-proving server, and the theorem-proving server represents the solution as a XML file conforming to the MSKML DTD and send it back to the client as the SOAP response message.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"22 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":"114308578","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
首页 上一页 下一页 尾页
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学术官方微信