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

Optimal data allocation in a bus computer network

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)
Lee, H. ; Dept. of Manage. Inf. Syst., Arizona Univ., Tuscon, AZ, USA ; Sheng, O.R.L.

A study is made of the partitioning of a global database and the allocation of the partitions in a bus computer system. The authors deal with systems where database partitioning and the allocation of the partitions to processing nodes can be solved simultaneously. The combined decision is referred to as data allocation. The objective is to allocate data so that the mean transaction response time is minimized. A queuing optimization model for solving the problem is formulated as a nonlinear programming problem. The uniqueness of the optimal policy is proved and an optimization procedure is developed. The model is illustrated with a sample system

Published in:

Computers and Communications, 1990. Conference Proceedings., Ninth Annual International Phoenix Conference on

Date of Conference:

21-23 Mar 1990

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.