OPTIMIZATION OF QUERIES REDISTRIBUTION IN CLUSTERS AT CHANGING ACTIVITY OF THE QUERIES SOURCES
Annotation
The problem of dynamic optimization of redistribution of queries through a network in a public cluster is formulated and solved. Optimization is performed to minimize the average time of queries stay, and to account for delays in display of number of the active knots which generate the queries.
Keywords
Постоянный URL
Articles in current issue
- EFFICIENCY OF FREQUENCY DOMAIN ALGORITHM OF DIGITAL IMAGE WATERMARKING BASED ON DISCRETE HADAMARD TRANSFORM
- A CONSISTENT MODEL OF MANDATORY ACCESS CONTROL
- A METHOD OF PROTECTION AGAINST DRIVE-BY DOWNLOAD ATTACKS
- WAYS FOR IMPROVING RECOGNITION ROBUSTNESS IN MULTIMODAL BIOMETRIC SYSTEMS
- TRANSFORMATION OF A NATURAL LANGUAGE TO RDF FORMAT USING SEMANTIC ANALYZERS OF TEXTUAL INFORMATION
- SERVICE QUALITY PARAMETERS OF ELECTRONIC INDUSTRY WEB SERVICES
- DESIGN OF SYSTEMS WITH PRIORITIES
- A METHOD FOR CALCULATION OF CHARACTERISTICS OF CLOSED DETERMINISTIC MODELS OF MULTI-SERVICE COMPUTER NETWORKS
- WAITING TIME IN FIFO-BASED MULTI-CLASS QUEUING SYSTEMS
- OPTIMIZATION OF QUERIES REDISTRIBUTION IN CLUSTERS AT CHANGING ACTIVITY OF THE QUERIES SOURCES
- ESTIMATION OF RELIABILITY OF EXECUTION OF REAL-TIME QUERIES
- RECONFIGURABLE EMBEDDED SYSTEMS AND SYSTEM-ON-CHIP
- TRANSACTION-LEVEL REAL-TIME CONSTRAINTS MONITOR FOR SYSTEM ON CHIP
- APPLICATION OF MULTIVALUED LOGIC IN FUNCTIONAL CIRCUITS DEVELOPMENT
- METHODS AND MEANS FOR MONITORING OF RESPIRATION
- SEARCH FOR PROCEDURE WITH THE USE OF FUNCTIONAL PROGRAM TRANSITION GRAPH TO VERIFY COMPUTATIONAL PROCESSES
- QUASI-ABSOLUTE DIGITIZER OF CORNER ON THE BASE OF DUAL-TRACK RECURSIVE NONLINEAR CODE SCALE
- CODE SCALES ON THE BASE OF INVERSELY CONJUGATED BINARY SEQUENCES