Image of Distributed algorithms for message-passing systems
Penanda Bagikan

Electronic Resource

Distributed algorithms for message-passing systems

Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities -- such as processes, peers, processors, nodes, or agents -- that individually have only a partial knowledge of the many input parameters associated with the problem. In particular each entity cooperating towards the common goal cannot have an instantaneous knowledge of the current state of the other entities. Whereas parallel computing is mainly concerned with 'efficiency', and real-time computing is mainly concerned with 'on-time computing', distributed computing is mainly concerned with 'mastering uncertainty' created by issues such as the multiplicity of control flows, asynchronous communication, unstable behaviors, mobility, and dynamicity.

Ketersediaan
#
Perpustakaan Pusat E1232
E1232
Tersedia
Informasi Detail
Judul Seri
-
No. Panggil
E1232
Penerbit
Germany : Springer-Verlag Berlin.,
Deskripsi Fisik
xxxi, 500 hlm.
Bahasa
English
ISBN/ISSN
9783642381232
Klasifikasi
NONE
Tipe Isi
text
Tipe Media
computer
Tipe Pembawa
online resource
Edisi
1st Ed
Subjek
Jaringan Komunikasi Komputer
Teori Komputasi
Info Detail Spesifik
-
Pernyataan Tanggungjawab
Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas
Komentar
Anda harus masuk sebelum memberikan komentar