Annals of Operations Research

, Volume 38, Issue 1, pp 397–419 | Cite as

Allocating modelling resources in distributed model management systems

  • Ishwar Murthy
  • Deb Ghosh
  • Allen Moffett
Article

Abstract

Due to the growing popularity of distributed computing systems and the increased level of modelling activity in most organizations, significant benefits can be realized through the implementation of distributed model management systems (DMMS). These systems can be defined as a collection of logically related modelling resources distributed over a computer network. In several ways, functions of DMMS are isomorphic to those of distributed database systems. In general, this paper examines issues viewed as central to the development of distributed model bases (DMB). Several criteria relevant to the overall DMB design problem are discussed. Specifically, this paper focuses on the problem of distributing decision models and tools (solvers), henceforth referred to as theModel Allocation Problem (MAP), to individual computing sites in a geographically dispersed organization. In this research, a 0/1 integer programming model is formulated for the MAP, and an efficient dual ascent heuristic is proposed. Our extensive computational study shows in most instances heuristic-generated solutions which are guaranteed to be within 1.5–7% of optimality. Further, even problems with 420 integer and 160,000 continuous variables took no more than 60 seconds on an IBM 3090-600E computer.

Keywords

Decision support systems model management distributed computing systems integer programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. Agarwal and D. Ghosh, Model selection and sequencing in decision support systems, OMEGA 19(1991)157–167.Google Scholar
  2. [2]
    A. Balakrishnan, T.L. Magnanti and R.T. Wong, A dual ascent procedure for large scale uncapacitated network design, Oper. Res. 37(1989)716–740.Google Scholar
  3. [3]
    R. Blanning, Model management systems, in:Decision Support Systems: Putting Theory into Practice, ed. R.H. Sprague and H.J. Watson (Prentice-Hall, Englewood Cliffs, NJ, 1989).Google Scholar
  4. [4]
    R.G. Casey, Allocation of copies of a file in an information network,Proc. AFIPS, Spring Joint Computer Conf. (1972), pp. 617–625.Google Scholar
  5. [5]
    S. Ceri and G. Pelagatti,Distributed Databases: Principles and Systems (McGraw-Hill, New York, 1984).Google Scholar
  6. [6]
    P. Chen and J. Akoka, Optimal design of distributed information systems, IEEE Trans. Comp. C-29(1980)1068–1080.Google Scholar
  7. [7]
    W. Chu, Optimal file allocation in a multiple computer system, IEEE Trans. Comp. C-18(1969)865–889.Google Scholar
  8. [8]
    W. Chu, Optimal file allocation in a computer network, in:Computer Communications Systems, ed. N. Abramson and F.F. Kuo (Prentice-Hall, Englewood Cliffs, NJ, 1973).Google Scholar
  9. [9]
    D.R. Dolk and B.R. Konsynski, Knowledge representation for model management systems, IEEE Trans. Software Eng. SE-10(1984)619–628.Google Scholar
  10. [10]
    D.R. Dolk and B.R. Konsynski, Model management in organizations, Inf. Manag. 9(1985)35–47.Google Scholar
  11. [11]
    D. Erlenkotter, A dual-based procedure for uncapacitated facility location, Oper. Res. 26(1978)992–1009.Google Scholar
  12. [12]
    K.P. Eswaran, Placement of records in a file and file allocation in a computer network,Information Processing 74, IFIPS, Stockholm, Sweden (North-Holland, Amsterdam, 1975), pp. 304–307.Google Scholar
  13. [13]
    M.L. Fisher and D.S. Hochbaum, Database location in computer networks, ACM 27(1980)718–735.Google Scholar
  14. [14]
    M.L. Fisher, R. Jaikumar and L. Van Wassenhove, A multiplier adjustment method for the generalized assignment problem, Manag. Sci. 32(1986)1095–1103.Google Scholar
  15. [15]
    B. Gavish and H. Pirkul, Allocation of databases and processors in a distributed computing system, in:Management of Distributed Data Processing, ed. J. Akoka (North-Holland, Amsterdam, 1982).Google Scholar
  16. [16]
    A.M. Geoffrion, Lagrangian relaxation for integer programming, Math. Progr. Study 2(1974)82–114.Google Scholar
  17. [17]
    D. Ghosh and R. Agarwal, The design of model bases in distributed environment, Working Paper, Department of Quantitative Business Analysis, Louisiana State University, Baton Rouge, Louisiana.Google Scholar
  18. [18]
    D. Ghosh and I. Murthy, File allocation involving worst case response times and link capacities: Model and solution procedure, Eur. J. Oper. Res., to appear.Google Scholar
  19. [19]
    D.P. Hale, W.D. Haseman and D.L. Munro, Architectural requirements for integrating group decision support systems into the daily managerial experience,Proc. 22nd Hawaii Int. Conf. on System Sciences, Vol. 3 (1989), pp. 321–325.Google Scholar
  20. [20]
    K.B. Irani and N.G. Khabaz, A methodology for the design of communications networks and the distribution of data in distributed supercomputer systems, IEEE Trans. Comp. C-31(1982)419–434.Google Scholar
  21. [21]
    M. Jarke and F.J. Radermacher, The AI potential of model management and its central role in decision support, Dec. Support Syst. 4(1988)387–404.Google Scholar
  22. [22]
    J.L. King, Centralized vs. decentralized computing: Organizational considerations and managerial options, ACM Comp. Surveys 15(1983)319–349.Google Scholar
  23. [23]
    G. Klein, Developing model strings for model managers, J. Manag. Inf. Syst. 3(1986)94–110.Google Scholar
  24. [24]
    L.J. Laning and M.S. Leonard, File allocation in a distributed computer communications network, IEEE Trans Comp. C-32(1983)232–244.Google Scholar
  25. [25]
    K.D. Levin and H.D. Morgan, Optimal program and data locations in computer networks, Comm. ACM 20(1976)315–321.Google Scholar
  26. [26]
    T.P. Liang, Model management for group decision support, MIS Quarterly (1988) 667–680.Google Scholar
  27. [27]
    T.L. Magnanti, P. Mireault and R.T. Wong, Tailoring Bender decomposition for network design, Math. Progr. Study 26(1986)112–154.Google Scholar
  28. [28]
    S. Mahmoud and J.S. Riordan, Optimal allocation of resources in distributed information networks, ACM Trans. Database Syst. 1(1976)66–78.Google Scholar
  29. [29]
    R. Ramesh and B. Ryan, Optimal file allocation and report assignment in distributed information networks, Naval Res. Logist. 37(1990)165–181.Google Scholar
  30. [30]
    L. Schrage, Implicit representation of variable upper bounds in linear programming, Math. Progr. Study 4(1979)118–132.Google Scholar
  31. [31]
    R.T. Wong, Dual ascent approach for Steiner tree problem on a directed graph, Math. Progr. 28(1984)271–287.Google Scholar

Copyright information

© J.C. Baltzer AG, Scientific Publishing Company 1992

Authors and Affiliations

  • Ishwar Murthy
    • 1
  • Deb Ghosh
    • 1
  • Allen Moffett
    • 1
  1. 1.Quantitative Business Analysis DepartmentLouisiana State UniversityBaton RougeUSA

Personalised recommendations