11115305
Graph Scaling: A Technique for Automating Program Construction and Deployment in ClusterGOP
Program development and resource management are critical issues in large-scaled parallel applications and they raise diffculties for the programmers. Automation tools can benefit the programmer by reducing the time and work required for programming, deploying, and managing parallel applications. In our previous work, we have developed a visual tool, VisualGOP, to help visual construction and automatic mapping of parallel programs to execute on the ClusterGOP platform, which provides a graph-oriented model and the environment for running the parallel applications on clusters. In VisualGOP, the programmer needs to manually build the task interaction graph. This may lead to scalability problem for large applications. In this paper, we propose a graph scaling approach that helps the programmer to develop and deploy a large-scale parallel application minimizing the effort of graph construction, task binding and program deployment. The graph scaling algorithms expand or reduce a task graph to match the specified scale of the program and the hardware architecture, e.g., the problem size, the number of processors and interconnection topology, so as to produce an automatic mapping. An example is used to illustrate the proposed approach and how programmer benefits in the automation tools.
8079300
Solving irregularly structured problems based on distributed object model
This paper presents a distributed object model called MOIDE (multi-threading object-oriented infrastructure on distributed environment) for solving irregularly structured problems. The model creates an adaptive computing infrastructure for developing and executing irregular applications on distributed systems. The infrastructure allows dynamic reconfiguration to match the evolution of irregular computation and available system resources. A unified communication mechanism is built to integrate different communication paths on heterogeneous systems to support efficient communication. Autonomous load scheduling approach is proposed for dynamic load balancing. A runtime system is developed to implement MOIDE-based computing. Applications including N-body problem, ray tracing, and conjugate gradient are developed to demonstrate the advantages of the model.
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.
12578633
High-level abstractions for message-passing parallel programming
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.
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.
17945809
New rate control algorithm for MPEG-4 video coding
This paper proposes a new MPEG-4 rate control algorithm for single or multiple object video sequences. The algorithm aims to achieve an accurate bit rate with the maximum picture quality while efficiently handling buffer fullness and scene change. In addition to estimating the bit budget of a frame based on its global coding complexity, the algorithm dynamically distributes the target bits for each object within a frame according to its coding complexity. Even though the VM8 solution and other algorithms adopt a simple proportional buffer controller, their control ability is rather ineffective. The proposed algorithm exploits a novel Proportional Integrated Differential (PID) buffer controller to effectively minimize the buffer overflow or underflow. The PID based controller reduces the deviation between the current buffer fullness and the target buffer fullness, mitigates the overshoots, and improves the transient response. The combined effect is a more smooth and effective buffer control. Furthermore, the algorithm defines a new and effective coding complexity of an object and dynamically optimizes several parameters. Overall, the proposed algorithm successfully achieves accurate target bit rate, provides promising coding quality, decreases buffer overflow/underflow and lowers the impact of a scene change.
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.
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.
16523105
Region-based rate control and bit allocation for wireless video transmission
In this paper, we propose a joint source-channel region-based rate control algorithm for real-time video transmissions over wireless systems. During the video transmission, the channel throughput available to the video encoder in the wireless systems is inherently variable, due to the retransmission of the error packets using the automatic repeat request (ARQ) error control. The variable data rate of the wireless system is characterized by the packet-level Gilbert two-state Markov Model, the parameters of which are extracted from the statistical properties of the channel information obtained from the wireless channel simulator. The proposed algorithm adopts a fast but effective block-based segmentation method to extract the regions of interest. Unlike traditional bit allocation methods used in the region/content-based rate control, the algorithm exploits the most effective criteria "coding qualities" as quantitative factors to directly control bit allocation among different regions so as to achieve better visual quality in the regions of interest. The computational complexity of the algorithm is low making it suitable for real-time applications. Compared with the MPEG-4 rate control algorithm, our algorithm can effectively enhance the perceptual quality for the regions of interest and significantly reduce the number of frame skipping; thereby, improve the smoothness of the video.