Книга: Real-Time Concepts for Embedded Systems
16.3.1 Resource Request Models
16.3.1 Resource Request Models
When tasks ask for resources, the way the task makes the requests can be classified into these request models:
· the Single resource request model,
· the AND resource request model,
· the OR resource request model, and
· the AND-OR resource request model.
In the Single resource request model, exemplified in both Figure 16.1 and Figure 16.2, a task can have at most one outstanding resource request at any given time. In the request model, a task asks for resources as in 'wants a printer.'
In the AND resource request model, a task can have multiple simultaneous requests outstanding at any given time. For example, a task can request resources as (R1 and R2) or (R1 and R2 and R3). A task is blocked until all of the requested resources are granted. In this request model, a task asks for resources as in "wants both a printer and a scanner." The task resumes execution only when it successfully acquires both the printer and the scanner.
In the OR resource request model, a task can request a set of resources, but the task can resume execution as soon as any one of the resources from the request set becomes available. For example, a task can request resources as (R1 or R2) or (R1 or R2 or R3). In this request model, a task asks for resources as in "wants either a printer or a scanner." The task resumes execution when it acquires either the printer or the scanner.
In the AND-OR resource request model, a task can make resource requests in any combination of the AND and OR models. For example, a task can request a set of resources as (R1 or R2 and (R3 or R4)). In this request model, the task asks for resources as in "wants either a printer or a scanner, and wants either a memory buffer or a message queue." The task can resume execution when it acquires both the printer and the memory buffer, when it acquires both the printer and the message queue, when it acquires the scanner and the memory buffer, or when it acquires the scanner and the message queue. A generalization of the AND-OR model is the C(n,k) model. In this model, a task can make n resource requests and can resume execution as soon as k resources are granted, where k ? n.
- Timestamp request
- Appendix E. Other resources and links
- ICMP Echo Request
- Information request
- Letting DHCP requests through iptables
- 15.4 Resource Synchronization Methods
- XMLHttpRequest
- Assessing Your Backup Needs and Resources
- Web Resources
- Printing Resource Usage with top
- APPENDIX B Installation Resources
- APPENDIX C Fedora and Linux Internet Resources