Data can be store as structured, semi-structured or unstructured formats in various distributed environments. Extraction of data from multiple data sources or data warehouse and convert to a proper order is quite time...
详细信息
Mobile computing systems have many constraints such as low battery power low bandwidth, high mobility and lack of stable storage which are not presented in static distributed systems. In this paper we propose an effic...
详细信息
ISBN:
(纸本)0769524052
Mobile computing systems have many constraints such as low battery power low bandwidth, high mobility and lack of stable storage which are not presented in static distributed systems. In this paper we propose an efficient communication-induced checkpointing protocol for mobile computing systems. We also propose an asynchronous recovery protocol based on the checkpointing protocol. Mobile support stations control major parts of the checkpointing and recovery such as storing and tracing the checkpoints, requesting rollback and logging messages, so that mobile hosts do not incur much overhead. The recovery algorithm has no domino effect and a failed process needs to roll back to its latest checkpoint and request only a subset of the processes to rollback to a consistent checkpoint. Our recovery protocol uses selective message logging at the mobile support station to handle the messages lost due to rollback.
Future Personal Communication Service (PCS) networks adopt smaller cells to accommodate continuously growing population of subscribers, which results in frequent location update and consequently higher signaling cost....
详细信息
ISBN:
(纸本)0769524052
Future Personal Communication Service (PCS) networks adopt smaller cells to accommodate continuously growing population of subscribers, which results in frequent location update and consequently higher signaling cost. In this paper, a ring removal movement-based location update scheme with a selective paging is proposed This location update scheme reduces the location updates by removing the ring formed in terminal's movement path. Numerical results show that the proposed movement-based update scheme provides a better performance than the improved movement-based registration (IMBR) scheme [1] when the terminal's callto-mobility (CMR) ratio [2] is small.
This paper discusses a parallel genetic algorithm (GA) which focuses on the local operator for Traveling salesman problem (TSP). The local operator is a simple GA named as Local Genetic Algorithm (LGA). The LGA is com...
详细信息
ISBN:
(纸本)0769524052
This paper discusses a parallel genetic algorithm (GA) which focuses on the local operator for Traveling salesman problem (TSP). The local operator is a simple GA named as Local Genetic Algorithm (LGA). The LGA is combined to another GA named as Global Genetic Algorithm (GGA). It increases the computational time running a GA as a local operator in another one. To solve this problem, we build a parallel system based on our previous works for running the LGA to speed up the process. The results show that LGA improve the search quality significantly and it is more efficient running LGA with parallel system than single CPU.
Large-scale distributed systems, with thousands or even millions of nodes, produce complex and dynamic behaviors. Packet-level simulation is necessary to test and analyze these systems, such as grids, peer-to-peer (P2...
详细信息
Multi-exponentiation may be performed faster than the traditional multiple square and multiply method by rearranging the exponentiation in an efficient sequence. For a suitable choice of such sequences, the resulting ...
详细信息
Multi-exponentiation may be performed faster than the traditional multiple square and multiply method by rearranging the exponentiation in an efficient sequence. For a suitable choice of such sequences, the resulting multi-exponentiation reduces the expected number of non-squaring multiplications at the cost of a rearrangement. Rearrangement effort depends entirely on the exponent and can be kept down to the work saved in a single exponentiation. Some methods of fast exponentiation have been proposed in the past years to make the implementation of public key cryptosystems easier;however, there are only a few parallel mechanisms for evaluating the modular multi-exponentiation. In this paper, we propose a parallel algorithm for modular multi-exponentiation. A fast and efficient implementation for this new parallel algorithm is also sketched. Besides, our parallel algorithm can be employed with other existing methods for further speedup. Both hardware and software implementations of the multi-exponentiation can benefit from this algorithm.
Using effective scheduling strategies to improve turnaround time, slowdown, and utilization is an important consideration in large supercomputing environments. Since such machines have traditionally used non-preemptio...
详细信息
With the increasing popularity of shared-memory programming model, especially at the advent of multicore processors, applications need to become more concurrent to take advantage of the increased computational power p...
详细信息
Efficient replica location in large-scale distributed systems is a challenging problem. In this paper, we propose a new decentralized replica location method to meet the requirement of replica location in such systems...
详细信息
Efficient replica location in large-scale distributed systems is a challenging problem. In this paper, we propose a new decentralized replica location method to meet the requirement of replica location in such systems. In our method each data object has a home node, which maintains the replica location information of the data object to accelerate the process of locating multiple replicas of the same data. A dynamic balancing technique which can adapt to the joining or departing of home nodes is proposed to spread global replica location information evenly on home nodes. Soft-state strategy is used to propagate update. Analysis and simulations show that our method can achieve low latency, good scalability, reliability, adaptability and is especially fit for the environments characterized by high query rates but low rates of nodes and network changes.
computing reversal distance of two signed permutations has gained increasing attention over the last decade with the study of genome rearrangements in computational molecular biology. In this paper, we present a paral...
详细信息
暂无评论