{"title":"A prioritized h-out of-k mutual exclusion algorithm with maximum degree of concurrency for mobile ad hoc networks and distributed systems","authors":"Jehn-Ruey Jiang","doi":"10.1109/PDCAT.2003.1236316","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236316","url":null,"abstract":"We propose a distributed prioritized h-out of-k mutual exclusion algorithm for a mobile ad hoc network (MANET) with real-time or prioritized applications. The h-out of-k mutual exclusion problem is a generalization of the k-mutual exclusion problem and the mutual exclusion problem. The proposed algorithm is sensitive to link forming and link breaking and thus is suitable for a MANET. If we do not consider the link breaking and forming, the proposed algorithm can also be applied to distributed systems consisting of stationary nodes that communicate with each other by exchanging messages over wired links. For nonreal-time applications, we may associate the priority with the number of requested resources to achieve the maximum degree of concurrency.","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":"123968568","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":"The design and implementation of the Chinese information retrieval with the automatically indexing method","authors":"Wang Bo, Fan Bing-bing, Yang hong-tao","doi":"10.1109/PDCAT.2003.1236431","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236431","url":null,"abstract":"The Chinese information manipulation system is the base of the navigating system. Distinguishing the noise words from the significant words, and picking up the semantics from the text are unsolved difficult problems. We bring forward the information manipulation method combining the key indexing method with the whole-length indexing method, by comparing main indexing methods in common use in the information indexing system and taking the Chinese features of the internal information navigating system. Its implementation is also provided. This new method preferably provides the full and nicety retrieval and solutes the increasing problems of the indexing space. In the end, the indexing method to the data which is manipulated by the Chinese information manipulation system is also provided.","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":"130362256","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":"Detection of mouse embryo atlas (MA) boundaries using a neural network","authors":"Y. Fan, E. Guest, N. Bowring","doi":"10.1109/PDCAT.2003.1236425","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236425","url":null,"abstract":"Many methods have been developed for image edge detection and most of these techniques work well in images with uniform regions, but less well in regions with greater nonuniformity. We describe an edge enhancing technique suitable for the complexity of histological images, such as those contained in the Mouse Embryo Atlas (MA). In order to achieve this, a new feature extraction method has been investigated which combines a probability neural network technique (PNN) with a novel edge detection algorithm. The PNN has been trained on several sets of appropriate images that classify a selection of pixels as edge or nonedge points. Our preliminary results are promising and show that edges of histological images have been detected.","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":"130377459","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":"Browser cache management for small wireless devices with memory and bandwidth constraints","authors":"Cheng-Zen Yang, Kun-Ming Tien, M. Wueng","doi":"10.1109/PDCAT.2003.1236321","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236321","url":null,"abstract":"As wireless networks become popular, Web surfing on mobile devices will be a hot Internet service in the near future. Mobile devices have two major constrains in their network bandwidth and memory size constraints. We propose a novel browser cache management mechanism in which a SAVUT-based gain function effectively decides the preservation value of cached objects. In addition, a partial caching mechanism is incorporated to extensively utilize the limited browser cache. Two SAVUT-based algorithms are presented to show the practical instances. The comparative simulation results are also elaborated. Although the conducted experiments are preliminary, the results show that PR-SAVUT best performs in most cases.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"16 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":"127417394","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":"Agent based computing basic architecture (ABCBA)","authors":"Zhang Yun-yong, Tan Hao, Liu Jin-de","doi":"10.1109/PDCAT.2003.1236345","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236345","url":null,"abstract":"After the persistent practice in the 1990's, using \"open system\" idea to integrate large-scale computer systems has been common practice. The new mechanism based on mobile agent is focused and the core architecture called common agent request broker architecture (CARBA) is established in order to embody intelligent collaboration in the next generation open system ABCBA. Then the extension of ABCBA in nomadic environment and validation of ABCBA openness is discussed. In the end, experiment results are given out.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"43 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":"127618761","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 wireless fair scheduling algorithm using proportional compensation","authors":"Jian Song, Le Min Li, J.J. Han","doi":"10.1109/PDCAT.2003.1236328","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236328","url":null,"abstract":"Wireless fair scheduling algorithm using proportional compensation is proposed. It can distinguish different application level services and use different queueing strategies for each class of services. A compensation strategy and a reallocation method in the algorithm to achieve wireless fair services are introduced. The compensation that the lagging flow can get is proportional to the lagging flow's original bandwidth.","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":"128938160","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":"Quadriphase sequences and sequence pairs with purely imaginary odd-periodic correlation sidelobes","authors":"F. Hu, Hong Wen, F. Jin","doi":"10.1109/PDCAT.2003.1236439","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236439","url":null,"abstract":"The construction of quadriphase sequences and sequence pairs with purely imaginary odd-periodic correlation sidelobes is discussed and a new binary odd-periodic complementary sequence set is constructed from odd-perfect almost binary sequences.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"38 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":"117004273","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 graph transformational approach to the multiprocessor scheduling of iterative computations","authors":"F. Sandnes, O. Sinnen","doi":"10.1109/PDCAT.2003.1236367","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236367","url":null,"abstract":"A modular strategy for scheduling iterative computations is proposed. An iterative computation is represented using a cyclic task-graph. The cyclic task-graph is transformed into an acyclic task-graph. This acyclic task-graph is subsequently scheduled using one of the many well-known and high-quality static scheduling strategies from the literature. Graph unfolding is not employed and the generated schedules therefore require less memory than schedules generated through graph unfolding. Further, the number of iterations does not need to be known at compile-time. The effectiveness of the approach is compared to other methods including a graph unfolding strategy. We experimentally quantify how the task transformation affects the make-span of the schedules.","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":"124499345","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":"An agent-based approach for grid computing","authors":"Chunlin Li, La-yuan Li","doi":"10.1109/PDCAT.2003.1236375","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236375","url":null,"abstract":"We present an agent-based computational grid (ACG), which applies the concept of computational grid to agents. The ACG system is to implement a uniform higher-level management of the computing resources and services on the grid, and provide users with a consistent and transparent interface for accessing such services. All entities in the grid environment including computing resources and services can be represented as agents. Each entity is registered with a grid service manager. An ACG grid service can be a service agent that provides the actual grid service to the other grid member. Grid members communicate with each other by communication space that is an implementation of tuple space. The design and implementation of four grid protocols for grid service discovery are given. Finally, some conclusions are given.","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":"117121727","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 FDTD algorithm based on domain decomposition method using the MPI library","authors":"Dan Yang, C. Liao, L. Jen, Jie Xiong","doi":"10.1109/PDCAT.2003.1236401","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236401","url":null,"abstract":"We present parallel algorithm for FDTD method. The algorithm is based on DDM (domain decomposition method). We use the MPI (message passing interface) library to implement the parallel DD-FDTD method. The original domain is decomposed into several subdomains according to the features of the problem, which are treated as the processes to computation nodes. The FDTD computation is carried out independently in local meshes in each process. The data are exchanged by communication between adjacent subdomains or with overlapped meshes and the interpolation scheme is applied to the data exchanged. The example of its application is given.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"154 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":"117209589","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}