16723593
A parallel Euler approach for large-scale biological sequence assembly
Biological sequence assembly is an essential step for sequencing the genomes of organisms. Sequence assembly is very computing intensive especially for the large-scale sequence assembly. Parallel computing is an effective way to reduce the computing time and support the assembly for large amount of biological fragments. Euler sequence assembly algorithm is an innovative algorithm proposed recently. The advantage of this algorithm is that its computing complexity is polynomial and it provides a better solution to the notorious "repeat" problem. This paper introduces the parallelization of the Euler sequence assembly algorithm. Alt the Genome fragments generated by whole genome shotgun (WGS) will be assembled as a whole rather than dividing them into groups which may incurs errors due to the inaccurate group partition. The implemented system can be run on supercomputers, network of workstations or even network of PC computers. The experimental results have demonstrated the performance of our system.
5173801
Load Balance Algorithms for Anycast
Increasingly, replicated anycast servers are being used to deliver network applications and service ever increasing user requests. Therefore, the strategies used to guarantee network bandwidth prerequisites and perform load balancing across the nodes of an anycast group are critical to the performance of online applications. In this paper, we model user requests, network congestion and latency, and server load using a combination of hydro-dynamics and queuing theory to develop an efficient job distribution strategy. Current, anycast research does not explicitly consider the system load of nodes within an anycast groups when distributing requests. Therefore, the performance of a heavily loaded anycast system can quickly become congested and uneven as jobs are routed to closely linked nodes which are already saturated with requests. In comparison, the nodes of further away systems remain relatively unused because of other issues such as network bandwidth and latency during these times. Our system redirects requests from busy systems to the idle, remotely linked nodes, to process requests faster in spite of slower network access. Using an empirical study, we show this technique can improve request performance, and throughput with minimal network probing overhead.
19315936
Lease Based Addressing for Event-Driven Wireless Sensor Networks
Sensor Networks have applications in diverse fields. They can be deployed for habitat modeling, temperature monitoring and industrial sensing. They also find applications in battlefield awareness and emergency (first) response situations. While unique addressing is not a requirement of many data collecting applications of wireless sensor networks it is vital for the success of applications such as emergency response. Data that cannot be associated with a specific node becomes useless in such situations. In this work we propose an addressing mechanism for event-driven wireless sensor networks. The proposed scheme eliminates the need for network wide Duplicate Address Detection (DAD) and enables reuse of addresses.
12866276
A Load Balancing Algorithm for Web Based Server Grids
Load balance is a critical issue in distributed systems, such as server grids. In this paper, we propose a Balanced Load Queue (BLQ) model, which combines the queuing theory and hydro-dynamic theory, to model load balance in server grids. Base on the BLQ model, we claim that if the system is in the state of global fairness, then the performance of the whole system is the best. We propose a load balanced algorithm based on the model: the algorithm tries its best to keep the system in the global fairness status using job deviation. We present three strategies: best node, best neighbour, and random selection, for job deviation. A number of experiments are conducted for the comparison of the three strategies, and the results show that the best neighbour strategy is the best among the proposed strategies. Furthermore, the proposed algorithm with best neighbour strategy is better than the traditional round robin algorithm in term of processing delay, and the proposed algorithm needs very limited system information and is robust.
19007096
A Self-Learning System for Identifying Harmful Network Information
Network information identification is a “hot” topic currently. This paper designs a self-learning system using neural network algorithm for identifying the harmful network messages of both Chinese and English languages. The system segments the message into words and creates key word vector which characterizes the harmful network information. The BP algorithm is taken advantage of to train the neural network. The result of training and studying of the neural network can be applied onto many network applications based on message identification. The result of experiments demonstrates that our system has a high degree of accuracy.
5267471
Fault-Tolerant Servers for Anycast Communication
Plenty of research has been done for any cast service, but few research touches the fault-tolerant problem based on the best of our knowledge. In this paper, we propose and analyse a fault-tolerant model, called twin server model, for anycast communication to provide reliable and continuous anycast services. We select a twin server in an anycast group for a given anycast server, the primary server. If the twin server suspects that its primary server is dead, it will take the unfinished job(s) of its primary server. We propose two algorithms: the server failure detecting algorithm and the server failure broadcasting algorithm. We then analyse the performance change when a primary server fails using queue theory and obtain some interesting conclusions. At the end, we summary the paper and present the future work.
62686547
Estimation of the size and location of multiple area light sources
Most illuminant estimation algorithms worked on point light sources or directional light sources. Little attempt has been made, however, to estimate area light sources. In this paper, we present a novel scheme that estimates the size and location of multiple area light sources using a set of stereo images of a sphere with a shiny surface. The parameters of the area light source are estimated by a novel algorithm which minimizes the matching error between the corresponding specular patches. Experiments on real images show that our method is accurate and robust in estimating the parameters of the area light source.
17849791
A tool for layered analysing and understanding of distributed programs
Distributed programs are harder to analyse and understand than sequential programs for a number of reasons. First, a distributed program consists of many entities at different levels of abstraction. Second, communication among the entities of a distributed program may happen concurrently and nondeterministically. To be able to analyse these entities and the communication events among them is therefore essential for understanding any distributed program. This paper describes a tool for assisting the analysis and understanding of distributed programs. The tool analyses the entities and communication events of a distributed program at four levels of abstraction. At the highest level, the tool displays the communication relationships between programs (e.g. server and client programs). At the second level, the communication between processes is displayed. At the third level, the communication between events is displayed. The fourth level is the lowest: it uses a text editor to show the relevant statements that carry out the communication. The tool has been used in the teaching of courses related to distributed computing since 1993.
17339667
The design and implementation of an active replication scheme for distributing services in a cluster of workstations
Replication is the key to providing high availability, fault tolerance, and enhanced performance in a cluster of workstations (COWs). However, building such a system remains as a difficult and challenging task, mainly due to the difficulty of maintaining data consistency among replicas and the lack of easy and efficient tools supporting the development procedure. In this paper we propose an active replication scheme in which data consistency can be maintained. Based on the active replication scheme, we present an object-oriented design pattern and a constructing tool to simplify the design and implementation of service replications in COWs.
1954273
An architecture for building reliable distributed object-based systems
This paper proposes an architecture for designing fault-tolerant distributed object systems. The proposed architecture attempts to bring advances in client-server, remote procedure call, reliable group communication, and object orientation technologies under a unified architecture to ease application developers' work of building reliable distributed systems. The resulting application systems should be enhanced with modularity and flexibility.
16218050
A tool for constructing service replication systems
Service replication as a key to providing high availability, fault tolerance and good performance in distributed systems. However, building a service replication system is a difficult and complex task. This paper describes a tool that mimics the design of the remote procedure call (RPC) system to support building distributed service replication systems. The tool includes an interface definition language for describing a replica group, a language preprocessor and a runtime library system.