Cart (Loading....) | Create Account
Close category search window
 

Double Relaxation -- GRASP Algorithm for Solve the Table Assignment Problem on Data Base Store Devices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cueva, R. ; Dept. de Ing., Pontificia Univ. Catolica del Peru, Lima ; Tupia, M.

At the present time one of the greatest problems of any computer system it is the obtaining of the data with the greater possible speed, avoiding times of delay for the users of these applications. By such reason, the administrators for systems always have looked for the form but adapted to optimize the applications, beginning by the data base, which one centralizes the data to be compiled. The importance of this is increased when having greater volume of stored information. It is as well as it is born the necessity to be able to make tasks of distribution of load between the devices that operate on this repository, as they are the processors, memory and hard disks. On this last device we will focus our study, since he is the one that grows with greater speed, having required but space for the data and is not single sufficient to acquire greater units of storage or to enclose them to already installed, but to look for the best form to balance the service load between these units. Frequently, database administrators use manual methods (statistical) or very basic algorithms (the first best one) to make this work, becoming but complex when being increased the number of objects of amount and the data base of storage units. This paper presents a GRASP algorithm for solve the GAP problem.

Published in:

Networked Computing and Advanced Information Management, 2008. NCM '08. Fourth International Conference on  (Volume:2 )

Date of Conference:

2-4 Sept. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.