Description
V sovremennyh vychisleniyah programmy neredko obedinyayut neskolko protsessov. Osnovnaya problema, voznikayuschaya pri sozdanii takih raspredelennyh programm, sostoit v tom, chtoby zastavit vse protsessy vmeste rabotat nad resheniem obschey zadachi, dazhe v sluchae otkazov nekotoryh iz nih.
Dannaya kniga soderzhit vvedenie v abstraktsii raspredelennogo programmirovaniya i znakomit s fundamentalnymi algoritmami i ih realizatsiyami v neskolkih raspredelennyh okruzheniyah. Pered chitatelem budut raskryty vazhnye problemy raspredelennyh vychisleniy i osnovnye algoritmicheskie priemy ih resheniya. Na podrobnyh primerah chitatel smozhet ponyat, kak s pomoschyu etih priemov konstruirovat raspredelennye prilozheniya. Obsuzhdenie kazhdoy temy zavershaetsya mnozhestvom uprazhneniy i ih resheniy.
Izdanie prednaznacheno dlya studentov vysshih uchebnyh zavedeniy, aspirantov, a takzhe programmistov, zanimayuschihsya razrabotkoy vysokonadezhnyh raspredelennyh prilozheniy.
Reviews
There are no reviews yet.