Pollack Periodica
Volume/Issue:
Volume 2: Issue Supplement-1
The bounds of the distributed data-intensive computing systems
Author: Antal Buza 1
View More View Less
  • 1 Institute of Informatics College of Dunaujvaros Tancsics utca 1/a H-2400 Dunaujvaros Hungary
DOI:
https://doi.org/10.1556/pollack.2.2007.s.8
Page Count:
85–96
Publication Date:
01 Dec 2007
Online Publication Date:
29 Jan 2008
Article Category:
Research Article
Restricted access

Purchase article

USD  $25.00

Purchase this article

USD  $387.00
Purchase Online Subscription

  • Purchase article

    USD  $25.00

  • Purchase this article

    USD  $387.00

The distributed computational systems and the distribution algorithms are thoroughly studied. In this paper we focus on data-intensive distributed problems including of task distributions, network delay times, join of the part task results, and the effect of non-execution. First we make a study of dedicated multi-computer systems in which the number of computers and the capacity of computers are almost constant. Then we analyze non-dedicated systems where the number and the free capacity of computers are frequently changed. The solution time of the full task depends on a large number of complex parameters. The effects of different parameters are demonstrated by numerical analysis based on behavior of distributed data-intensive super-computing systems.

  • Agha G.A. A model of concurrent computation in distributed systems. MIT Press , Cambridge, 1986.

    Agha G.A. , '', in A model of concurrent computation in distributed systems , (1986 ) -.

  • Ben-Ari M. Principles of Concurrent Programming. Prentice-Hall , Engelwood, 1982.

    Ben-Ari M. , '', in Principles of Concurrent Programming , (1982 ) -.

  • Lynch N. A. Distributed Algorithms, Morgan Kaufmann Publishers Inc. , San Francisco, USA, 2000.

    Lynch N. A. , '', in Distributed Algorithms , (2000 ) -.

  • Lamport L., Lynch N. Distributed Computing: Models and methods. Handbook of Theoretical Computer Science , 1157–1199, North-Holland, New York, 1990.

    Lynch N. , '', in Handbook of Theoretical Computer Science , (1990 ) -.

  • Tel G. Introduction to distributed algorithms. Cambridge Univ. Press , Cambridge, 2001.

    Tel G. , '', in Introduction to distributed algorithms , (2001 ) -.

  • Foster I. (editor), The Grid: Blueprint of a New Computing Infrastructure, Morgan Kaufmann Publishers Inc. , San Francisco, USA, 1999.

    '', in The Grid: Blueprint of a New Computing Infrastructure , (1999 ) -.

  • Tannenbaum A. S. Computer Networks, Prentice-Hall , 1997

  • Bar-Noy A., Dolev D., Koller D., Peleg D. Fault-tolerant critical section management in asynchronous environments. Inform. Comput. , 95(1): 1–20, 1991

    Peleg D. , 'Fault-tolerant critical section management in asynchronous environments ' (1991 ) 95 Inform. Comput. : 1 -20.

    • Search Google Scholar

  • Benczúr A., Buza A. Modelling of response time of distributed data intensive computing systems. ARGESIM Report No. 24. Vienna, Austria, 2003, 1331–1338

    Buza A. , '', in ARGESIM Report No. 24 , (2003 ) -.

  • Buza A., Kis P. The Third Period of Information technology, The Sixth Fenno-Ugric Symposium on Software Technology , Tallin, Estonia, 1999, 269–275.

    Kis P. , '', in The Sixth Fenno-Ugric Symposium on Software Technology , (1999 ) -.

  • Milner R. Communication and Concurrency. Prentice-Hall , United Kingdom, 1989.

    Milner R. , '', in Communication and Concurrency , (1989 ) -.
Cover Pollack Periodica
Pollack Periodica
Print ISSN:
1788-1994
Online ISSN:
1788-3911
Keywords:
Distributed systems; Task distribution; Handling of non-completion

Monthly Content Usage

Abstract Views Full Text Views PDF Downloads
Aug 2020 4 0 0
Sep 2020 0 0 0
Oct 2020 0 0 0
Nov 2020 1 2 0
Dec 2020 1 0 0
Jan 2021 0 0 0
Feb 2021 0 0 0