{"title":"A One-Way File Replica Consistency Model in Data Grids","authors":"Chao-Tung Yang, Wenpin Tsai, Tsui-Ting Chen, Ching-Hsien Hsu","doi":"10.1109/APSCC.2007.75","DOIUrl":"https://doi.org/10.1109/APSCC.2007.75","url":null,"abstract":"In recent years, grid technology, which is frequently used to solve the scientific problem, has ripened gradually. A large number of storage resources and computational power are combined to form a data grid network to deal with massive data of scientific experiments. Data replication generates huge data which are distributed in wide-area for researches around the globe. The files of grid environments can be modified by grid users might bring a critical problem of maintaining data consistency among the several replicas distributed in different machines. For that reason how to maintain the consistency of those files is a great challenge. In this paper, we propose a Oneway Replica Consistency model in data grid environments, which is used for consistency maintenance issue. Furthermore, we anticipate striking a balance between improving data access performance and replica consistency in data grids. This work can find out the more efficient ways of utilizing storage space is an important point.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125331799","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":"Research & implementation of uCLinux-based embedded browser","authors":"Wang Minting, Fagui Liu","doi":"10.1109/APSCC.2007.51","DOIUrl":"https://doi.org/10.1109/APSCC.2007.51","url":null,"abstract":"Embedded browser is an important component to support Ubiquitous Computing in Information Appliances. How to develop an uCLinux-based embedded browser remains to be a big challenge and quite demanding. This paper uses Konqueror/embedded as a prototype. Based on the interactivity between the bottom network connection layers, it proposes a theory to turn the multi-process mechanism into multi-threads one and implements successfully on uCLinux, which provides us a methodology of how to transplant a concurrent system from normal Linux to uCLinux.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124361981","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":"Using NIC-Based Multicast Scheme to Improve Forwarding Rate for Application Layer Multicast","authors":"Jijun Cao, Jinshu Su, Chunqing Wu","doi":"10.1109/APSCC.2007.68","DOIUrl":"https://doi.org/10.1109/APSCC.2007.68","url":null,"abstract":"Recently, application layer multicast (ALM) has become an effective alternative to IP multicast across the Internet. By deeply analyzing the characteristics of traditional packet forwarding in end host, this paper proposes a high performance multicast scheme, in which a NIC-based multicast mechanism is used to send multiple replicas of a ALM packet to different destinations with less CPU intermediation compared to the traditional host- based multicast scheme. By adopting the NIC-based multicast scheme, the CPU overhead and the number of times data packets are copied from host memory to NIC buffer are reduced. Theoretical analysis indicates that the new scheme can notably decrease the multicast delay and enhance the service capability of ALM proxies. We have modified the NIC driver and added some corresponding APIs to network protocol stack in order to implement the proposed scheme. Experimental results illustrate that the NIC-based multicast scheme can greatly improve forwarding rate for ALM.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124894348","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 Formal Model for Web Service Composition and Its Application Analysis","authors":"Bixin Li, Yu Zhou, Ying Zhou, Xufang Gong","doi":"10.1109/APSCC.2007.10","DOIUrl":"https://doi.org/10.1109/APSCC.2007.10","url":null,"abstract":"The formal description of Web service is the basis for analyzing and verifying the Web service composition. In this article, a simple pattern-oriented mathematical model for Web service composition is introduced according to following steps: firstly, single service model is formally defined; secondly, several kinds of interaction logics between services are discussed and the composition pattern is presented, the realization of the interaction logics are given at the same time; thirdly, the definition of Web service composition model and the algorithms are presented; finally, a running example is discussed based on our model. The model can express the interactive logic relationships between messages well and it can also be used to simulate the interaction between services via message passing.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124938718","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":"Balanced Job Assignment Based on Ant Algorithm for Computing Grids","authors":"R. Chang, Jih-Sheng Chang, Po-Sheng Lin","doi":"10.1109/APSCC.2007.41","DOIUrl":"https://doi.org/10.1109/APSCC.2007.41","url":null,"abstract":"Grid computing is a new research subject. The computing power and storage space of grids is collected from heterogeneous or homogeneous resources in order to support complicated computing problems. Job scheduling in computing grid is a very important problem. Current scientific applications become more complex and need huge computing power and storage space. It may take a very long time to complete a complicated job. However, to utilize grids, we need an efficient job scheduling algorithm to assign jobs to resources in grids. In this paper, we propose a Balanced Ant Colony Optimization (BACO) algorithm for job scheduling in the Grid environment. There are two schemes introduced in this paper regarding local and global pheromone update. The main contributions of our work are to balance the entire system load and minimize the makespan of a given set of jobs. Compared with the other proposed algorithms, BACO can outperform them according to the experimental results.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126615585","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 Layered Optimization Approach for Redundant Reader Elimination in Wireless RFID Networks","authors":"Ching-Hsien Hsu, Yi-Min Chen, Chao-Tung Yang","doi":"10.1109/APSCC.2007.59","DOIUrl":"https://doi.org/10.1109/APSCC.2007.59","url":null,"abstract":"The problem of redundant RFID reader elimination has instigated researchers to propose different optimization heuristics due to the rapid advance of technologies in large scale RFID systems. In this paper, we present a layered elimination optimization (LEO) which is an algorithm independent technique aims to detect maximum amount of redundant readers could be safely removed or turned off with preserving original RFID network coverage. A significant improvement of the LEO scheme is that number of \"write-to-tag\" operations could be largely reduced during the redundant reader identification phase. Moreover, LEO is a distributed scheme which does not need to collect global information for centralizing control, leading no communications and synchronizations among RFID readers. To evaluate the performance of the proposed techniques, we have implemented the LEO technique along with another redundant reader identification algorithm and other hybrid schemes. In experimental results, the LEO is shown to be effective and provides superior performance in terms of larger number of redundant reader could be detected and with lower algorithm overheads.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128755616","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":"Investigating the Potential of Service Oriented Architectures to Realize Dynamic Capabilities","authors":"Haresh Luthria, F. Rabhi, M. Briers","doi":"10.1109/APSCC.2007.70","DOIUrl":"https://doi.org/10.1109/APSCC.2007.70","url":null,"abstract":"The paradigm of service-oriented computing (SOC) has emerged as an architectural approach to flexibility and agility, not just in systems development but also in business process management. There is, however, a paucity of critical research assessing the strategic impact of SOA on the competitiveness of organizations. Some research literature in strategic management indicates that firms may gain a competitive advantage in rapidly changing market environments by concentrating on their dynamic capabilities - i.e., product flexibility and agility in organizational transformation in response to rapidly changing market conditions and customer requirements. The intent of this paper is to analyze the conduits through which service-oriented architectures (SOAs) may exert influence on dynamic capabilities within firms. The results could potentially assist in evaluating if and how the adoption of service-oriented architecture may help achieve key dynamic capabilities, giving the enterprise a competitive edge.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129839920","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":"Game-Theoretic Approach for Partial Sharing of Information","authors":"M. Raweewan, W. Ferrell","doi":"10.1109/APSCC.2007.53","DOIUrl":"https://doi.org/10.1109/APSCC.2007.53","url":null,"abstract":"This paper presents an integrated methodology to support decision making in cooperation through interorganizational information sharing. The methodology employs game-theoretic approach to determine whether it is advantageous to share information in situations of 1) competition-cooperation and 2) co-opetition. The decision allows partial sharing of information which we quantify on a scale from 0 to 100%. The focus of this research is developing a methodology to determine the optimal strategy to assist decision makers so we limit the choices to three specific shapes for the payoff functions: linear, concave nonlinear, and convex nonlinear. These three types of function; however, capture human behavior. Linear, concave, and convex utility functions are employed for players who prefer risk-neutral, risk averse, and risk loving, respectively. Finally, examples are provided to illustrate how the methodology can be used in practice.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132214793","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}
Zhenghua Xue, Xiaoshe Dong, Siyuan Ma, Shengqun Fan, Yiduo Mei
{"title":"An Energy-Efficient Management Mechanism for Large-Scale Server Clusters","authors":"Zhenghua Xue, Xiaoshe Dong, Siyuan Ma, Shengqun Fan, Yiduo Mei","doi":"10.1109/APSCC.2007.54","DOIUrl":"https://doi.org/10.1109/APSCC.2007.54","url":null,"abstract":"With the increase of the computing demand, high performance server clusters are becoming one of the most important computing infrastructures. The current clusters are designed to meet peak load with all the computing resources keeping running. However, this static reservation with full computing resources can not adapt to the time-varying computing requirement, and may incur low resource utilization and needless power consumption when the cluster system is underloaded. In this paper, we present an extensible architecture of cluster management system. This architecture promises a good extensibility by integrating job scheduler and resource manager in loose couple. Concentrating on the power saving of large-scale clusters, we describe the power model of servers, and based on the presented management system architecture, we propose a novel resource management way, adaptive pool based resource management (APRM) method, for adaptive provision of computing resources in accordance with the time- varying workload demand. APRM enables a cost- effective operating by providing dynamic computing capacity with automatic resource control. We validated APRM on the energy efficiency and quality of service (QoS) by simulation measurement, and the results showed that APRM yields significant power saving with little impact on QoS.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132655180","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":"Implementation of Monitoring and Information Service Using Ganglia and NWS for Grid Resource Brokers","authors":"Chao-Tung Yang, Tsui-Ting Chen, Sung-Yi Chen","doi":"10.1109/APSCC.2007.74","DOIUrl":"https://doi.org/10.1109/APSCC.2007.74","url":null,"abstract":"Grid computing is increasingly used by organizations to achieve high performance computing and heterogeneous resources sharing. These grids may span several domain administrations via Internet. As a result of this, it may be difficult to monitor, control and manage those machines and resources. This paper aims at providing a multi-platform grid monitoring service which can monitor resources such as CPU speed and utilization, memory usage, disk usage, and network bandwidth in a real-time manner. Monitoring data is extracted form Ganglia and NWS tools then stored and transmitted in XML form and then used for displaying. All the information is displayed using real-time graphs.","PeriodicalId":370753,"journal":{"name":"The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116233829","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}