A near-optimal database allocation for reducing the average waiting time in the grid computing environment

DOI10.1016/j.ins.2009.07.003zbMath1194.68109OpenAlexW1996608139MaRDI QIDQ730954

Kuen-Fang Jea, Jen-Ya Wang

Publication date: 1 October 2009

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2009.07.003

zbMATH Keywords

optimizationgradientgrid computingaverage waiting timedata sharingdatabase allocation

Mathematics Subject Classification ID

Database theory (68P15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (1)

Modeling a dynamic data replication strategy to increase system availability in cloud computing environments

Cites Work

• A coordinated planning model for the design of a distributed database system
• Fuzzy integral-based perceptron for two-class pattern classification problems
• Fast discovery of sequential patterns in large databases using effective time-indexing
• A linearly convergent method for broadcast data allocation
• On comparing two sequences of numbers and its applications to clustering analysis
• Mobile data and transaction management
• Deadline division-based heuristic for cost optimization in workflow scheduling
• Single vehicle routing with a predefined customer sequence and multiple depot returns
• Efficient data allocation over multiple channels at broadcast servers
• Iterative Solution of Nonlinear Equations in Several Variables

This page was built for publication: A near-optimal database allocation for reducing the average waiting time in the grid computing environment