A near-optimal database allocation for reducing the average waiting time in the grid computing environment
From MaRDI portal
Publication:730954
DOI10.1016/J.INS.2009.07.003zbMATH Open1194.68109OpenAlexW1996608139MaRDI QIDQ730954FDOQ730954
Authors: Jen-Ya Wang, Kuen-Fang Jea
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
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Database theory (68P15) Distributed systems (68M14)
Cites Work
- A linearly convergent method for broadcast data allocation
- Iterative Solution of Nonlinear Equations in Several Variables
- Efficient data allocation over multiple channels at broadcast servers
- Single vehicle routing with a predefined customer sequence and multiple depot returns
- On comparing two sequences of numbers and its applications to clustering analysis
- A coordinated planning model for the design of a distributed database system
- Mobile data and transaction management
- Deadline division-based heuristic for cost optimization in workflow scheduling
- Fuzzy integral-based perceptron for two-class pattern classification problems
- Fast discovery of sequential patterns in large databases using effective time-indexing
Cited In (1)
This page was built for publication: A near-optimal database allocation for reducing the average waiting time in the grid computing environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730954)