Parallel I/O scheduling in the presence of data duplication on multiprogrammed cluster computing systems

The widespread adoption of cluster computing as a high performance computing platform has seen the growth of data intensive scientific, engineering and commercial applications such as digital libraries, climate modeling, computational chemistry, computational fluid dynamics and image repositories. However, I/O subsystem performance has not been keeping pace with processor and memory performance, and is fast becoming the dominant factor in overall system performance.  Thus, parallel I/O has become a necessity in the face of performance improvements in other areas of computing systems. This paper addresses the problem of parallel I/O scheduling on cluster computing systems in the presence of data replication.  We propose two new I/O scheduling algorithms and evaluate the relative performance of the proposed policies against two existing approaches.  Simulation results show that the proposed policies perform substantially better than the baseline policies.

Multi-cluster computing interconnection network performance modeling and analysis

The overall performance of a distributed system is often depends on the effectiveness of its interconnection network. Thus, the study of the communication networks for distributed systems is very important, which is the focus of this paper. In particular, we address the problem of fat-tree based interconnection networks performance modeling for multi-user heterogeneous multi-cluster computing systems. To this end, we present an analytical model and validate the model through comprehensive simulation. The results of the simulation demonstrated that the proposed model exhibits a good degree of accuracy for various system organizations and under different working conditions.

Analytical communication networks model for enterprise grid computing

This paper addresses the problem of performance analysis based on the communication modeling of large-scale heterogeneous distributed systems, with an emphasis on enterprise Grid computing systems. The study of communication layers is important, as the overall performance of a distributed system often critically hinges on the effectiveness of this part. We propose an analytical model that is based on probabilistic analysis and queuing networks. The proposed model considers the processor as well as network heterogeneity of the enterprise Grid system. The model is validated through comprehensive simulations, which demonstrate that the proposed model exhibits a good degree of accuracy for various system sizes, and under different working conditions.

Pervasive computing at tableside : a wireless web-based ordering system

Purpose – The purpose of this paper is to introduce a wireless web-based ordering system called iMenu in the restaurant industry. Design/methodology/approach – By using wireless devices such as personal digital assistants and WebPads, this system realizes the paradigm of pervasive computing at tableside. Detailed system requirements, design, implementation and evaluation of iMenu are presented.

Findings – The evaluation of iMenu shows it explicitly increases productivity of restaurant staff. It also has other desirable features such as integration, interoperation and scalability. Compared to traditional restaurant ordering process, by using this system customers get faster and better services, restaurant staff cooperate more efficiently with less working mistakes, and enterprise owners thus receive more business profits.

Originality/value – While many researchers have explored using wireless web-based information systems in different industries, this paper presents a system that employs wireless multi-tiered web-based architecture to build pervasive computing systems. Instead of discussing theoretical issues on pervasive computing, we focus on practical issues of developing a real system, such as choosing of web-based architecture, design of input methods in small screens, and response time in wireless web-based systems.

Optimal multicast tree routing for cluster computing in hypercube interconnection networks

Cluster computation has been used in the applications that demand performance, reliability, and availability, such as cluster server groups, large-scale scientific computations, distributed databases, distributed media-on-demand servers and search engines etc. In those applications, multicast can play the vital roles for the information dissemination among groups of servers and users. This paper proposes a set of novel efficient fault-tolerant multicast routing algorithms on hypercube interconnection of cluster computers using multicast shared tree approach. We present some new algorithms for selecting an optimal core (root) and constructing the shared tree so as to minimize the average delay for multicast messages. Simulation results indicate that our algorithms are efficient in the senses of short end-to-end average delay, load balance and less resource utilizations over hypercube cluster interconnection networks.

A new approach for efficiently achieving high availability in mobile computing

Recent advances m hardware technologies such as portable
computers and wireless communication networks have led to the emergence of mobile computing systems. Thus, availability and accessibility of the data and services become important issues of mobile computing systems. In this paper, we present a data replication and management scheme tailored for such environments In the proposed scheme data is replicated synchronously over stationary sites while for the mobile network, data is replicated asynchronously based on commonly visited sites for each user. The proposed scheme is compared with other techniques and is shown to require less communication cost for an operation as well as provide higher degree of data availability.

Ontology learning from text: a soft computing paradigm

Text-based information accounts for more than 80% of today’s Web content. They consist of Web pages written in different natural languages. As the semantic Web aims at turning the current Web into a machine-understandable knowledge repository, availability of multilingual ontology thus becomes an issue at the core of a multilingual semantic Web. However, multilingual ontology is too complex and resource intensive to be constructed manually. In this paper, we propose a three-layer model built on top of a soft computing framework to automatically acquire a multilingual ontology from domain specific parallel texts. The objective is to enable semantic smart information access regardless of language over the Semantic Web.

Analytical performance modeling of the enterprise grid computing

This paper addresses the problem of performance modeling of large-scale heterogeneous distributed systems with emphases on enterprise grid computing systems. To this end, we present an analytical model that can be employed to explore the effectiveness of different design approaches so that one can have an intelligent choice during design and evaluation a cost-effective large-scale heterogeneous distributed computing system. The model is validated through comprehensive simulation.

Dynamic reconfiguration of multi-agent systems based on autonomy oriented computing

Dynamic reconfiguration has been listed as one of the key challenges in support of agent adaptation to environments, which has attracted much attention of researchers world wide. To tackle this tough problem, an agent-based dynamic reconfiguration model (ADRM) is proposed from the autonomy-oriented computing (AOC) point of view. The ERA (environment-reactive rules-agents) algorithm used in AOC is improved to support the organization formation behavior, which is essential in dynamic reconfiguration. To test the efficiency of this model and the effectiveness of different reactive behaviors, the performance of this model was investigated under different selection probabilities.

Analytical interconnection networks model for multi-cluster computing systems

This paper addresses the problem of interconnection networks performance modeling of large-scale distributed systems with emphases on multi-cluster computing systems. The study of interconnection networks is important because the overall performance of a distributed system is often critically hinged on the effectiveness of its interconnection network. We present an analytical model that considers stochastic quantities as well as processor heterogeneity of the target system. The model is validated through comprehensive simulation, which demonstrates that the proposed model exhibits a good degree of accuracy for various system sizes and under different operating conditions.

Analysis of multi-cluster computing systems with processor heterogeneity

This paper addresses the problem of performance modeling of heterogeneous multi-cluster computing systems. We present an analytical model that can be employed to explore the effectiveness of different design approaches so that one can have an intelligent choice during design and evaluation of a cost effective large-scale heterogeneous distributed computing system. The proposed model considers stochastic quantities as well as processor heterogeneity of the target system. The analysis is based on a parametric fat-tree network, the m-port n-tree, and a deterministic routing algorithm. The correctness of the proposed model is validated through comprehensive simulation of different types of clusters.