12751111
A taxonomy of application scheduling tools for high performance cluster computing
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper presents a survey on the software tools for the graph-based scheduling on cluster systems with the focus on task scheduling. The tasks of a parallel or distributed application can be properly scheduled onto multi-processors in order to optimize the performance of the program (e.g., execution time or resource utilization). In general, scheduling algorithms are designed based on the notion of task graph that represents the relationship of parallel tasks. The scheduling algorithms map the nodes of a graph to the processors in order to minimize overall execution time. Although many scheduling algorithms have been proposed in the literature, surprisingly not many practical tools can be found in practical use. After discussing the fundamental scheduling techniques, we propose a framework and taxonomy for the scheduling tools on clusters. Using this framework, the features of existing scheduling tools are analyzed and compared. We also discuss the important issues in improving the usability of the scheduling tools.
14951106
A grid-based system for microbial genome comparison and analysis
Genome comparison and analysis can reveal the structures and junctions of genome sequences of different species. As more genomes are sequenced, genomic data sources are rapidly increasing such that their analysis is beyond the processing capabilities of most research institutes. The grid is a powerful solution to support large-scale genomic data processing and genome analysis. This paper presents the Microbase project that is developing a grid-based system for genome comparison and analysis, and discusses the first implementation of the system (called MicrobaseLite). MicrobaseLite uses a scalable computing environment to support computationally intensive microbial genome comparison and analysis, employing state-of-the-art technologies of Web services, notification, comparative genomics and parallel computing. Microbase will support not only system-defined genome comparison and analysis but also user-defined, remotely conceived genome analysis.
14112050
Distributed particle simulation method on adaptive collaborative system
Abstract This paper presents a distributed N-body method based on an adaptive collaborative system model. The collaborative system is formed by the distributed objects on a distributed system. The system can be reconfigured during the computation to fully utilize the computing power of the networked hosts. The method is implemented in Java and RMI to support distributed computing in heterogeneous environment. A distributed tree structure is designed for communication-efficient computation of N-body method. The performance test shows satisfactory speedup and portability of the method on both homogeneous and heterogeneous clusters. The collaborative system model can be used in various applications and it is expandable to wide-area environment.
1423209
Scalable load balancing on distributed web servers using mobile agents
Distributed web servers on the immensely expanding Internet require high scalability and availability to provide efficient services to millions of clients on the web. To provide rapid responses to enormous number of client requests, load balancing is an important technique to evenly distribute the requests to web servers. In this paper, we propose a framework called Mobile Agent based LoaD balancing (MALD) that uses mobile agents technology to implement scalable load balancing on distributed web servers. The web servers can dispatch mobile agents to collect system-wide load information and accomplish load redistribution on all servers. Various load-balancing policies can be incorporated with versatile mobile agents in the framework. Compared with the traditional message-passing-based load-balancing methods, the mobile-agent-based approaches have the merits of high flexibility, low network traffic and high asynchrony. The performance evaluation demonstrates that the MALD framework provides a foundation to develop efficient load-balancing schemes on wide range of web server systems from cluster to the Internet.
14338621
A distributed object model for solving irregularly structured problems on cluster
This paper presents a distributed object model MOIDE (Multithreaded Object-oriented Infrastructure on Distributed Environment) for solving irregularly structured problems on cluster. The primary appeal of MOIDE is its flexible system structure that is adaptive to heterogeneous architecture of a cluster. MOIDE integrates the object-oriented and multithreaded methodologies to set up a unified computing environment. Both the shared-data access and remote messaging are incorporated in a two-layer communication mechanism for efficient inter-object communication with the common communication interface. MOIDE supports dynamic load balancing by its autonomous load scheduling technique. A runtime support system implements the MOIDE model as a platform-independent infrastructure for developing and executing irregularly structured applications. N-body, ray tracing, and conjugate gradient applications are implemented to illustrate the advantages of MOIDE model.
15800513
ClusterProbe: an open, flexible and scalable cluster monitoring tool
In this paper, we describe the ClusterProbe, an open, flexible, scalable, and Java-based cluster monitoring tool. The tool provides an open environment by developing a multiple-protocol communication interface that can be connected to various types of external accesses from the clients. ClusterProbe is flexible that the monitoring tool can be easily extended to adapt to the resource changes by using the Java-RMI mechanism. In addition, the design of ClusterProbe allows it to scale up to commodious capacity with its cascading hierarchical architecture. Several useful services are implemented based on ClusterProbe, including the visualization of cluster resource information in various form and cluster fault management. The tool has been used to assist the execution of a cluster-based search engine and a distributed N-body application. All experiments demonstrate high efficiency.
47269670
Motion estimation for content adaptive video compression
A multistage motion estimation scheme is proposed. The scheme extracts video characteristics by first performing an online video analysis separately for foreground and background regions. Motion parameters are extracted and passed to the next stage. The next stage includes a mathematical model for the block distortion surface (BDS) that enables the algorithm to accordingly adjust its search technique. The search is performed on a precise search area adaptive to the statistical property of the motion vector prediction error. Due to its self-tuning property, not only does the proposed scheme adapt to scenes by yielding better visual quality but it also yields a lower computational complexity, compared with the other predictive motion estimation algorithms on standard benchmark sequences
61852216
Cross-Evaluation: A new model for information system evaluation
In this article, we introduce a new information system evaluation method and report on its application to a collaborative information seeking system, AntWorld. The key innovation of the new method is to use precisely the same group of users who work with the system as judges, a system we call Cross-Evaluation. In the new method, we also propose to assess the system at the level of task completion. The obvious potential limitation of this method is that individuals may be inclined to think more highly of the materials that they themselves have found and are almost certain to think more highly of their own work product than they do of the products built by others. The keys to neutralizing this problem are careful design and a corresponding analytical model based on analysis of variance. We model the several measures of task completion with a linear model of five effects, describing the users who interact with the system, the system used to finish the task, the task itself, the behavior of individuals as judges, and the self-judgment bias. Our analytical method successfully isolates the effect of each variable. This approach provides a successful model to make concrete the “three-realities” paradigm, which calls for “real tasks,” “real users,” and “real systems.” © 2006 Wiley Periodicals, Inc.
137366579
Transparent silica glasses containing single-walled carbon nanotubes
Organic - Inorganic matrix nano composites have been created using an acid catalyzed, tetraethyl orthosilicate-based sol- gel technique with SWNTs. By utilizing nanotubes functionalized with the dendron methyl 3,5- di(methyltrigycoloxy)benzylic alcohol, ultrasonication blending in the sol phase prior to gelation yields excellent dispersion characteristics of the nanotube phase. Further, glasses could easily be dried by heating to 600 degrees C yielding 80 percent of theoretical density wit little change in the nanotube content. These materials exhibited intrinsic Rayleigh scattering, suggesting near ideal dispersion. Nonlinear optical transmissivity was observed for 1064 and 532 nm light suggesting that the matrix has a strong broad band coupling to the optical field. Such composites allow for a host of applications based on the novel confinement properties of carbon nanotubes in a robust host.
11138467
Reconfigurable Resource Scheduling with Variable Delay Bounds
Certain emerging network applications involve dynamically allocating shared resources to a variety of services to provide QoS guarantees for each service. Motivated by such applications, we address the following online scheduling problem belonging to the recently introduced class of reconfigurable resource scheduling problems: unit jobs of different categories arrive over time and need to be completed within category-specific delay bounds, or else they are dropped at a unit drop cost; processors can be reconfigured to process jobs of a certain category at a fixed reconfiguration cost; the goal is to minimize the total cost. We study this problem in the framework of competitive analysis. Through a novel combination of the EDF and LRU scheduling principles, we obtain an online algorithm that is constant competitive when given a constant factor resource advantage over an optimal offline algorithm.
15422371
Priority assessment of software requirements from multiple perspectives
The development of complex software systems involves collecting software requirements from various stakeholders. Often stakeholder perceptions conflict during the requirements elicitation phase. An effective technique to resolve such a conflict is needed. We presented a framework that prioritizes software requirements gathered from multiple stakeholders by incorporating inter-perspective relationships, which is not addressed by existing priority assessment techniques. We use a relationship matrix to analyze the impact between requirements and facilitate the integration process which assesses their priorities based on their relationships from multiple perspectives. It allows the development team to resolve conflicts effectively and concentrate their valuable time and resources on the critical few requirements from multiple perspectives that directly contribute to high customer satisfaction.