![](/assets/images/picto-drapeau-france-3a76576a5d60a512053b4612ab58dae5.png)
4. Placement
In this section, we briefly present the state-of-the-art in methods for placing tasks on the various nodes of a distributed system. Classically, the problems of assigning tasks to the different processors in a distributed architecture fall into two categories:
static placement: this involves highlighting a distribution of tasks for a given hardware architecture. The allocation procedure takes place before the application is started, and the result is fixed for the life of the application. This type of placement requires a thorough knowledge of hardware and software architectures;
dynamic placement: this type of problem arises during application execution. Specifically, it may be necessary to reassign tasks when the software architecture is modified (i.e. when a task is created or deleted) or when the hardware...
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference
This article is included in
Control and systems engineering
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Placement
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference