Sciweavers

1049 search results - page 70 / 210
» Simulation of load balancing algorithms: a comparative study
Sort
View
ICPP
2003
IEEE
14 years 3 months ago
Effective Real-time Anycast Flow Connection Algorithm and Delay Analysis
Define anycast services as a group of replicated servers that may provide similar or identical services. Using anycast services can significantly simplify some applications such...
Weijia Jia, Chuanlin Zhang, Lidong Lin, Wanqing Tu...
TPDS
1998
125views more  TPDS 1998»
13 years 10 months ago
An Efficient Dynamic Scheduling Algorithm For Multiprocessor Real-Time Systems
—Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for no...
G. Manimaran, C. Siva Ram Murthy
CN
2007
104views more  CN 2007»
13 years 10 months ago
Performance analysis of the AntNet algorithm
A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of a...
S. S. Dhillon, Piet Van Mieghem
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
13 years 10 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
AB
2008
Springer
14 years 12 days ago
The Geometry of the Neighbor-Joining Algorithm for Small Trees
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
Kord Eickmeyer, Ruriko Yoshida