ALLOCATING DATA AND WORKLOAD AMONG MULTIPLE SERVERS IN A LOCAL-AREA NETWORK

Authors
Citation
H. Lee et T. Park, ALLOCATING DATA AND WORKLOAD AMONG MULTIPLE SERVERS IN A LOCAL-AREA NETWORK, Information systems, 20(3), 1995, pp. 261-269
Citations number
26
Categorie Soggetti
System Science","Information Science & Library Science","Computer Science Information Systems
Journal title
ISSN journal
03064379
Volume
20
Issue
3
Year of publication
1995
Pages
261 - 269
Database
ISI
SICI code
0306-4379(1995)20:3<261:ADAWAM>2.0.ZU;2-D
Abstract
Local area networks (LANs) have become indispensable in today's highly competitive business environment. A LAN connects multiple file server s for many concurrent information retrievals. The system administrator has to resolve two allocation problems, workload and data. The alloca tion decisions are interrelated; a transaction is routed to the server that contains the data items requested. Affinity-based workload alloc ation is employed, and the database is thus fragmented into data files that are allocated across multiple servers. The paper's two primary o bjectives are (i) to provide a rationale for workload and data allocat ion and (ii) to present an analytical model which will attain effectiv e allocation policies. The integrated problem is presented in the form of a nonlinear zero-one integer program. A special structure of the p roblem is employed to demonstrate the complexity of the problem, and t o propose an algorithm.