Content deleted Content added
fix capitalization |
m fix capitalization |
||
Line 12:
| author = Wallace, D.
|date=May 2007
}}</ref> [[Sandia National Laboratories]] has an almost two-decade commitment to
| title = Designing and Implementing Lightweight Kernels for Capability Computing
| publisher = Concurrency and Computation: Practice and Experience
Line 38:
LWK implementations vary, but all strive to provide applications with predictable and maximum access to the [[CPU]] and other system resources. To achieve this, simplified algorithms for scheduling and memory management are usually included. System services (e.g. daemons), are limited to the absolute minimum. Available services, such as job launch are constructed in a hierarchical fashion to ensure scalability to thousands of nodes. Networking protocols for communication between nodes in the system are also carefully selected and implemented to ensure scalability. One such example is the [[Portals network programming application programming interface|Portals network programming API]].
Lightweight
By restricting services to only those that are absolutely necessary and by streamlining those that are provided, the overhead (sometimes called noise) of the lightweight operating system is minimized. This allows a significant ''and'' predictable amount of the processor cycles to be given to the parallel application. Since the application can make consistent forward progress on each processor, they will reach their synchronization points at the same time. Lost wait time is reduced.
|