On the Implementation Time of Distributed Computing in Synchronous Mode with a Limited Number of Copies of a Software Resource

This paper constructs a mathematical model of distributed computing with a limited number of copies of a structured software resource. In the cases of unlimited and limited parallelism with respect to the number of processors in a multiprocessor distributed computing system, the problems of finding...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Programming and computer software Jg. 51; H. 6; S. 435 - 445
1. Verfasser: Pavlov, P. A.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Moscow Pleiades Publishing 01.12.2025
Springer Nature B.V
Schlagworte:
Algorithms
Artificial Intelligence
Competition
Computational mathematics
Computer Science
Computers
Decomposition
Distributed processing
Efficiency
Multiprocessing
Network computers
Operating Systems
Scheduling
Software
Software Engineering
Software Engineering/Programming and Operating Systems
unlimited (limited) parallelism
Gantt chart
structuring
Bellman–Johnson functional
software resource
pipelining
synchronous mode
ISSN:0361-7688, 1608-3261
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper constructs a mathematical model of distributed computing with a limited number of copies of a structured software resource. In the cases of unlimited and limited parallelism with respect to the number of processors in a multiprocessor distributed computing system, the problems of finding the minimum execution time of heterogeneous, homogeneous, and identically distributed competitive processes in synchronous mode, which ensures the continuous execution of each block of software resource by all processes, are solved.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0361-7688
1608-3261
DOI:10.1134/S0361768825700306