Time and cost tradeoff for distributed data processing

Time and cost tradeoff for distributed data processing (1989)

by Heeseok Lee

Venue:	Computers ind. Engng
Citations:	3 - 1 self

Datum	Value	Source
TITLE	Time and cost tradeoff for distributed data processing	INFERENCE
AUTHOR NAME	Heeseok Lee	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Management Information Systems, College of Business and Public Administration,; University of Arizona, Tucson	SVM HeaderParse 0.2
AUTHOR ADDR	AZ 85721, U.S.A.	SVM HeaderParse 0.2
ABSTRACT	Abstract--An important design issue in distributed data processing systems is to determine optimal data distribution. The problem requires a tradeoff between time and cost. For instance, quick response time conflicts with low cost. The paper addresses the data distribution problem in this conflicting environment. A formulation of the problem as a non-linear program is developed. An algorithm employing a simple search procedure is presented, which gives an optimal data distribution. An example is solved to illustrate the method.	SVM HeaderParse 0.2
YEAR	1989	SVM HeaderParse 0.2
VENUE	Computers ind. Engng	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	553--558	INFERENCE
VOLUME	16	INFERENCE
CITATIONS	18 found	ParsCit 1.0