{"title":"Rule discovery with PVMA algorithm","authors":"Yan Xue-song, Cai Zhi-hua","doi":"10.1109/PDCAT.2003.1236429","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236429","url":null,"abstract":"Data mining is becoming increasingly important since the size of database grows even larger and the need to explore hidden rules from the database becomes widely recognized. We present PVMA algorithm, a parallel a priori algorithm that uses parallel virtual machine (PVM) to discovery rules in database. This algorithm exploits the data parallelism, by distributing the data being mined across all available processors.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"32 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":"129615640","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}
{"title":"Multipath banyan-based multistage networks for ATM switches","authors":"Sheng-de Wang, P.M.H. Dai","doi":"10.1109/PDCAT.2003.1236314","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236314","url":null,"abstract":"Owing to the single path property of the banyan network, cell losses caused by the internal conflicts is well pronounced. To overcome this problem, multipath ATM switches have been investigated. We propose a class of ATM switch architectures that are constructed based on 3/spl times/3 switch elements (SEs). The proposed structures are constructed by adding lateral links to the banyan network to provide many paths between each input/output pair. As a result, the cell losses caused by internal conflicts are significantly reduced. And the proposed switch models are very modular, easy to expand, and use self-routing. The proposed switches use output queues to deal with the problem of cell sequence. From the analysis and simulation results, the proposed switches have the features of low cell loss probability and low cell delay.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"5 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":"128563906","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}
{"title":"Study of DCOM-based simulation applied in locomotive & track coupling dynamics","authors":"Di Guofu","doi":"10.1109/PDCAT.2003.1236384","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236384","url":null,"abstract":"Locomotive-track coupling dynamical simulation has made good achievements (W.M. Zhai, 1997; G.F. Ding, 2003). However, a problem, how to improve the simulating speed when visualization and dynamical computation are considered at the same time, is still not overcome. Here, based on existing success, we present a distributed COM technology, which is used to change the status of the present slow speed simulation. Here, at first, the locomotive-track dynamics system is modeled, a resolving formula is discussed, and visualization of the system is given, then the characteristic of the main integration resolving algorithm is analyzed, which is the reason of actuating the DCOM method. Secondly, we divide these resolving equations into several separated module, which is distributed in different resolving machine as a COM, and construct a distributed parallel computing environment, this method effectively reduces the computing load of the main computer and the computing speed is improved, which is the basement of real-time simulation such as virtual dynamical test of locomotive.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"302 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":"128579226","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}
{"title":"Design of broadband IPv6/lPv4 dual-stack access router based on service stream","authors":"Jiming Gao, Yu Zhang, Limin Hou, Ziqiang Hou","doi":"10.1109/PDCAT.2003.1236247","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236247","url":null,"abstract":"Access network is the important part of Internet. But conventional access technologies do not support well on user management, service providing, authentication and accounting at present. We propose a new IPv6/IPv4 access router, which integrates access aggregation, edge routing and service policy into one box, and supports different services according to different service streams. The service stream table acts as routing table, neighbor address resolving table and access policy table. It can do user authentication and accounting, bidirectional traffic statistics, bidirectional rate control, prepaid traffic limit, access control list and off-line detection.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"6 21 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":"124537260","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}
{"title":"Equipartitioning versus marginal analysis for parallel job scheduling","authors":"B. G. Patrick, M. Jack","doi":"10.1109/PDCAT.2003.1236410","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236410","url":null,"abstract":"Given n malleable and nonpreemptable parallel jobs that arrive for execution at time 0, we examine and compare two job scheduling strategies that allocate m identical processors among the n competing jobs. In all cases, n/spl les/m. The first strategy is based on the heuristic paradigm of equipartitioning, and the second is based on the notion of marginal analysis. Equipartitioning uses no a priori information when processor allocations are made to parallel jobs. Marginal analysis, on the other hand, assumes full a priori information in order to maximize processor utility. We compare both strategies with respect to average time-to-completion (system performance) and overall time-to-completion (system efficiency). Using a simple job model characterized by sequential time-to-completion and degree of parallelism, it is demonstrated via simulation that in most cases, the uninformed strategy of equipartitioning outperforms marginal analysis with respect to system performance and without a commensurate degradation in system efficiency.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"48 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":"121326330","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}
{"title":"Mapping data-flow graph to loop engine on array processor","authors":"Y. Dou, Xicheng Lu","doi":"10.1109/PDCAT.2003.1236389","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236389","url":null,"abstract":"We present a novel architecture for array processor, called LEAP, which is a set of simple processing elements. The targeted programs are perfect innermost loops. By using the technique called if-conversion, the control dependence can be converted to data dependence to prediction variables. Then an innermost loop can be represented by a data dependence graph, where the vertex supports the expression statements of high level languages. By mapping the data dependence graph to fixed PEs, each PE steps the loop iteration automatically and independently at the runtime. The execution forms multiple pipelining chains. The simulation of four loops of LFK shows the effectiveness of the LEAP architecture, compared with traditional CISC and RISC architectures.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"144 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":"116441696","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}
Fan Xin-yuan, Xu Guo-zhi, Ying Ren-dong, Zhang Hao, Jiang Le-tian
{"title":"Performance analysis of software rejuvenation","authors":"Fan Xin-yuan, Xu Guo-zhi, Ying Ren-dong, Zhang Hao, Jiang Le-tian","doi":"10.1109/PDCAT.2003.1236365","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236365","url":null,"abstract":"Cluster-based systems, a combination of interconnected individual computers, have become a popular solution to build the scalable and highly available Web servers. In order to reduce system outages due to aging phenomenon, software rejuvenation, a proactive fault-tolerance strategy has been introduced into cluster systems. Compared with clusters of a flat architecture, in which all the nodes share the same functions, we model and analyze the dispatcher-worker based cluster systems, which employ prediction-based rejuvenation both on the dispatcher and the worker pool. To evaluate the effects of rejuvenation, stochastic reward net models are constructed and solved by SPNP (stochastic Petri net package). Numerical results show that prediction-based software rejuvenation can significantly increase system availability and reduce the expected job loss probability.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"355 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":"116448086","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}
{"title":"Integrated safety critical systems on reliable real time network","authors":"Shiping Yang, Nan Sang, Guang-ze Xiong","doi":"10.1109/PDCAT.2003.1236260","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236260","url":null,"abstract":"Safety critical systems require reliable and predictable behaviors in their communication operations. To overcome the lack of deterministic characteristics in CAN protocol, we research a soft-oriented approach based on FTT-CAN protocol combining event-triggered and time-triggered traffic. In order to encourage safety critical systems to take advantage of the increased processing and communication power and multiple traditionally federated applications to move toward more integrated systems. In addition to the integrated system model details, temporal isolation based on two-level hierarchical scheduling mechanism and schedulability analyses of communication network based on FTT-CAN protocol are described in detail, and provide an approach to determinate slot width of communication network based on FTT-CAN protocol.","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":"128972040","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}
{"title":"A parallel algorithm for frequent itemset mining","authors":"Li Li, Dong-hai Zhai, F. Jin","doi":"10.1109/PDCAT.2003.1236435","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236435","url":null,"abstract":"Frequent itemsets mining plays an essential role in data mining. A new algorithm PFP-growth (parallel FP-growth), which is based on the improved FP-growth, is proposed for parallel frequent itemset mining. The new algorithm distributes the task fairly among the parallel processors. We devise partitioning strategies at different stages of the mining process to achieve balance between processors and adopt some data structure to reduce the information transportation between processors. The experiments on national high performance parallel computer show that the PFP-growth is an efficient parallel algorithm for mining frequent itemset.","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":"128972577","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}
{"title":"A kind of network security behavior model based on game theory","authors":"X. You, Shiyong Zhang","doi":"10.1109/PDCAT.2003.1236458","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236458","url":null,"abstract":"We study security interactive behavior between the hacker and the defender, under which an innovated new idea is emphasized. The process of attack and defend is supposed as the n different rational and noncooperative players under incomplete information, which is accord with n person incomplete information game. When the hackers attack the defender, they attempt to get their satisfied payoff, however, the defenders always hope to get their satisfied payoff, which will form the Nash equilibrium of game theory. The defenders can use the Nash equilibrium point to analysis and asset their security. The defenders can also use the Nash equilibrium as the reference of security investment.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"233 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":"127436845","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}