This paper introduces an effective memetic algorithm for the linear ordering problem with cumulative costs. The proposed algorithm combines an order-based recombination operator with an improved forward-backward local search procedure and employs a solution quality based replacement criterion for pool updating. Extensive experiments on 118 well-known benchmark instances show that the proposed a...

State machine replication is a common approach for building fault-tolerant services. A Replicated State Machine (RSM) typically uses a consensus protocol such as Paxos [1] to decide on the order of updates and thus keep replicas consistent. Using Paxos, the RSM can continue to process new requests, as long as more than half of the replicas remain operational. If this bound is violated, however,...

We measure the performance of several cooperative caching policies for a database with hot spots. The workload consists of queries and append-only update transactions, and is modeled after a financial database of stock (historical) trading information. We show that cooperative caching is effective for this application. We show that selecting the correct set of peer servers when servicing a cach...

Heterogeneous devices have been adopted widely in mobile storage systems because a combination of such devices can supply a synergistically useful storage solution by taking advantage of each device. In heterogeneous storage systems there have been several researches for enhancing I/O performance by devising proper buffer cache management algorithms. This paper presents a novel device-aware buf...

Of the many tuning parameters available in a database management system (DBMS), one of the most crucial to performance is the buffer pool size. Choosing an appropriate size, however, can be a difficult task. In this paper we present an analytical modeling approach to predicting the buffer pool hit rate that can be used to simplify the process of buffer pool sizing. Since the buffer replacement ...

today according to the competitive conditions, companies try to reduce their inventory level to diminish the costs. in companies inventory management and control should establish a balance between inventory level of spare parts, cost and the risk that arising from absence of part when is needed. it is clear that this level of spare parts inventory affected by facility characteristics and its re...

Adaptive Replacement Cache (Arc) and CLOCK with Adaptive Replacement (Car) are state-of-theart “adaptive” cache replacement algorithms invented to improve on the shortcomings of classical cache replacement policies such as Lru, Lfu and Clock. By separating out items that have been accessed only once and items that have been accessed more frequently, both Arc and Car are able to control the harm...

0950-5849/$ see front matter 2008 Elsevier B.V. A doi:10.1016/j.infsof.2008.08.002 * Corresponding author. Tel.: +1 919 513 4151. E-mail addresses: [email protected] ncsu.edu (L. Williams), [email protected] (T. Xie). Since 2002, over 10% of total cyber vulnerabilities were SQL injection vulnerabilities (SQLIVs). This paper presents an algorithm of prepared statement replacement for rem...

The manuscript presents the replacement algorithm of digital image watermarking. The tool used for processing is discrete wavelet transform (DWT). The method includes the process of dividing the digital image into multiple frequency bands which are replaced by the content of secrete image. This phenomenon is used to provide copyright protection, imperceptibility to the user. Peak signal to nois...

Caching frequently accessed data items on the client side is an effective technique to improve performance in a mobile environment. Classical cache management strategies may not be suitable for mobile environments due to the disconnection and mobility of the mobile clients. In this paper, we propose a novel Cache Management Architecture (CMA) for mobile hosts. The goal of our architecture is to...