𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A comparison of concurrent programming and cooperative multithreading

✍ Scribed by Aaron W. Keen; Takashi Ishihara; Justin T. Maris; Tiejun Li; Eugene F. Fodor; Ronald A. Olsson

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
251 KB
Volume
15
Category
Article
ISSN
1532-0626

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A comparison of concurrent programming a
A comparison of concurrent programming and cooperative multithreading under load balancing applications
✍ Justin T. Maris; Aaron W. Keen; Takashi Ishihara; Ronald A. Olsson πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 210 KB

## Abstract Two models of thread execution are the general concurrent programming execution model (CP) and the cooperative multithreading execution model (CM). CP provides nondeterministic thread execution where context switches occur arbitrarily. CM provides threads that execute one at a time unti

Predicting and Bounding the Speedup of M
Predicting and Bounding the Speedup of Multithreaded Solaris Programs
✍ Lars Lundberg πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 180 KB

In Solaris, threads are frequently relocated. The data associated with a relocated thread have to be moved from the cache of the old processor to the new processor. In order to avoid poor memory performance due to thread relocation, threads can be bound to processors static scheduling. Finding a sta

A Multithreaded Message Passing Interfac
A Multithreaded Message Passing Interface (MPI) Architecture: Performance and Program Issues
✍ Boris V. Protopopov; Anthony Skjellum πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 222 KB

This paper discusses a multithreaded software architecture for messagepassing interface (MPI) software specification. The architecture is thread-safe, allows for concurrent communication over several communications media (multifabric communication), efficiently utilizes available hardware concurrenc

A Comparison of Implicit and Explicit Pa
A Comparison of Implicit and Explicit Parallel Programming
✍ Vincent W. Freeh πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 329 KB

a Only synchronization is termination detection. All shared data are read-only. b Edge sharing with neighbors. Compute maximum change between iterations. c Fork/join parallelism. No data sharing. d Decreasing work. Every iteration disseminate values to all. e Variable amount of work.