A Dynamic Load-Balancing Policy with a Central Job Dispatcher (LBC)
IEEE Transactions on Software Engineering
Exploiting process lifetime distributions for dynamic load balancing
ACM Transactions on Computer Systems (TOCS)
Iterative solution of nonlinear equations in several variables
Iterative solution of nonlinear equations in several variables
Job placement with unknown duration and no preemption
ACM SIGMETRICS Performance Evaluation Review
Mobile data and transaction management
Information Sciences—Informatics and Computer Science: An International Journal
Efficient Data Allocation over Multiple Channels at Broadcast Servers
IEEE Transactions on Computers
(Almost) Optimal parallel block access for range queries
Information Sciences—Informatics and Computer Science: An International Journal
A coordinated planning model for the design of a distributed database system
Information Sciences—Informatics and Computer Science: An International Journal
The impact of predictive inaccuracies on execution scheduling
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
Information Sciences: an International Journal
Fuzzy integral-based perceptron for two-class pattern classification problems
Information Sciences: an International Journal
An indexing method for wireless broadcast XML data
Information Sciences: an International Journal
A hyperplane based indexing technique for high-dimensional data
Information Sciences: an International Journal
Distributed multi-join query processing in data grids
Information Sciences: an International Journal
Design and analysis of a load balancing strategy in data grids
Future Generation Computer Systems - Special section: Data mining in grid computing environments
Design and development of Distributed Virtual Geographic Environment system based on web services
Information Sciences: an International Journal
Information Sciences: an International Journal
An on-line replication strategy to increase availability in Data Grids
Future Generation Computer Systems
Game-Theoretic Approach for Load Balancing in Computational Grids
IEEE Transactions on Parallel and Distributed Systems
A linearly convergent method for broadcast data allocation
Computers & Mathematics with Applications
Fast discovery of sequential patterns in large databases using effective time-indexing
Information Sciences: an International Journal
On comparing two sequences of numbers and its applications to clustering analysis
Information Sciences: an International Journal
Immune K-means and negative selection algorithms for data analysis
Information Sciences: an International Journal
Algorithms for validating E-tickets in mobile computing environment
Information Sciences: an International Journal
Deadline division-based heuristic for cost optimization in workflow scheduling
Information Sciences: an International Journal
Lifetime service level agreement management with autonomous agents for services provision
Information Sciences: an International Journal
A trust degree based access control in grid environments
Information Sciences: an International Journal
Modeling machine availability in enterprise and wide-area distributed computing environments
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
On-demand broadcast for multiple-item requests in a multiple-channel environment
Information Sciences: an International Journal
A Transformation Technique for Scheduling Broadcast Programs of Multiple-Item Queries
International Journal of Grid and High Performance Computing
Efficient processing of requests with network coding in on-demand data broadcast environments
Information Sciences: an International Journal
A Transformation Technique for Scheduling Broadcast Programs of Multiple-Item Queries
International Journal of Grid and High Performance Computing
The Journal of Supercomputing
Hi-index | 0.07 |
In a grid computing environment, a great many users may access the same database simultaneously. To reduce the average waiting time for all users, a grid designer usually replicates the frequently accessed database among nodes based on the load balance heuristic. On the other hand, users may raise identical queries regarding an issue of interest, e.g., stock information, on a database and each of the queries will be directed to any node having a replica of that database. That is, the same answer will be determined by multiple nodes. Consequently, there exist two shortcomings of poor data sharing and duplicate calculations if the database is not replicated and allocated adequately. In this paper, we aim to minimize average waiting time and try to overcome the two shortcomings by performing database allocation over multiple nodes without any replication. The main idea behind the proposed method is to map the original problem to the Euclidean space R^n and to solve the mapped problem in R^n by a gradient-based optimization technique. The theoretical analyses ensure that the proposed method can converge linearly and achieve near-optimal results.