IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v52y2005i6p590-605.html
   My bibliography  Save this article

An approximate planning model for distributed computing networks

Author

Listed:
  • John S. Hollywood

Abstract

We develop an approximate planning model for a distributed computing network in which a control system oversees the assignment of information flows and tasks to a pool of shared computers, and describe several optimization applications using the model. We assume that the computers are multithreaded, and have differing architectures leading to varying and inconsistent processing rates. The model is based on a discrete‐time, continuous flow model developed by Graves [Oper Res 34 (1986), 522–533] which provides the steady‐state moments of production and work‐in‐queue quantities. We make several extensions to Graves' model to represent distributed computing networks. First, we approximately model control rules that are nonlinear functions of the work‐in‐queue at multiple stations through a linearization approach. Second, we introduce an additional noise term on production and show its use in modeling the discretization of jobs. Third, we model groups of heterogeneous computers as aggregate, “virtual computing cells” that process multiple tasks simultaneously, using a judiciously selected control rule. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.

Suggested Citation

  • John S. Hollywood, 2005. "An approximate planning model for distributed computing networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 590-605, September.
    • Handle: RePEc:wly:navres:v:52:y:2005:i:6:p:590-605
    DOI: 10.1002/nav.20098
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20098
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20098?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. James R. Jackson, 1957. "Networks of Waiting Lines," Operations Research, INFORMS, vol. 5(4), pages 518-521, August.
    2. Eric V. Denardo & Christopher S. Tang, 1992. "Linear Control of a Markov Production System," Operations Research, INFORMS, vol. 40(2), pages 259-278, April.
    3. Eric V. Denardo & Christopher S. Tang, 1997. "Control of a Stochastic Production System with Estimated Parameters," Management Science, INFORMS, vol. 43(9), pages 1296-1307, September.
    4. James R. Jackson, 1963. "Jobshop-Like Queueing Systems," Management Science, INFORMS, vol. 10(1), pages 131-142, October.
    5. Stephen C. Graves, 1986. "A Tactical Planning Model for a Job Shop," Operations Research, INFORMS, vol. 34(4), pages 522-533, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rong Yuan & Stephen C. Graves, 2016. "Setting optimal production lot sizes and planned lead times in a job shop," International Journal of Production Research, Taylor & Francis Journals, vol. 54(20), pages 6105-6120, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Delasay, Mohammad & Ingolfsson, Armann & Kolfal, Bora & Schultz, Kenneth, 2019. "Load effect on service times," European Journal of Operational Research, Elsevier, vol. 279(3), pages 673-686.
    2. Scott Webster & Z. Kevin Weng, 2001. "Improving Repetitive Manufacturing Systems: Model and Insights," Operations Research, INFORMS, vol. 49(1), pages 99-106, February.
    3. Francisco Castro & Hamid Nazerzadeh & Chiwei Yan, 2020. "Matching queues with reneging: a product form solution," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 359-385, December.
    4. Sauer Cornelia & Daduna Hans, 2003. "Availability Formulas and Performance Measures for Separable Degradable Networks," Stochastics and Quality Control, De Gruyter, vol. 18(2), pages 165-194, January.
    5. Bing Lin & Rohit Bhatnagar & Yuchen Lin, 2024. "Admission Control of Parallel Queues with Fork Types of Jobs," Methodology and Computing in Applied Probability, Springer, vol. 26(4), pages 1-30, December.
    6. Flötteröd, G. & Osorio, C., 2017. "Stochastic network link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 180-209.
    7. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    8. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    9. Sumi Kim & Seongmoon Kim, 2015. "Differentiated waiting time management according to patient class in an emergency care center using an open Jackson network integrated with pooling and prioritizing," Annals of Operations Research, Springer, vol. 230(1), pages 35-55, July.
    10. Yaron Yeger & Uri Yechiali, 2024. "A generalized ASIP with arrivals to all sites and particle movements in all directions," Annals of Operations Research, Springer, vol. 343(1), pages 515-542, December.
    11. Kurt M. Bretthauer, 2000. "Optimal service and arrival rates in Jackson queueing networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(1), pages 1-17, February.
    12. Haskose, A. & Kingsman, B. G. & Worthington, D, 2004. "Performance analysis of make-to-order manufacturing systems under different workload control regimes," International Journal of Production Economics, Elsevier, vol. 90(2), pages 169-186, July.
    13. Nico Dijk & Barteld Schilstra, 2022. "On two product form modifications for finite overflow systems," Annals of Operations Research, Springer, vol. 310(2), pages 519-549, March.
    14. Osorio, Carolina & Wang, Carter, 2017. "On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 305-339.
    15. D Worthington, 2009. "Reflections on queue modelling from the last 50 years," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 83-92, May.
    16. Bretthauer, Kurt M., 1996. "Capacity planning in manufacturing and computer networks," European Journal of Operational Research, Elsevier, vol. 91(2), pages 386-394, June.
    17. Osorio, Carolina & Bierlaire, Michel, 2009. "An analytic finite capacity queueing network model capturing the propagation of congestion and blocking," European Journal of Operational Research, Elsevier, vol. 196(3), pages 996-1007, August.
    18. Weng, Z. Kevin, 1998. "Managing production with flexible capacity deployment for serial multi-stage manufacturing systems," European Journal of Operational Research, Elsevier, vol. 109(3), pages 587-598, September.
    19. Veneklaas, W. & Leeftink, A.G. & van Boekel, P.H.C.M. & Hans, E.W., 2021. "On the design, implementation, and feasibility of hospital admission services: The admission lounge case," Omega, Elsevier, vol. 100(C).
    20. Hadjinicola, George C. & Soteriou, Andreas C., 2003. "Reducing the cost of defects in multistage production systems: A budget allocation perspective," European Journal of Operational Research, Elsevier, vol. 145(3), pages 621-634, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:52:y:2005:i:6:p:590-605. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.