Bo I. Sandén
- 1.M. Awad, J. Kuusela, and J. Ziegler. Object-oriented technology for real-time systems, Prentice-Hall 1996 Google Scholar
Digital Library
- 2.E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Obiect-Oriented Software, Addison-Wesley 1995 Google ScholarDigital Library
- 3.H. Gomaa. Software Desian Methods for Concurrent and Realtime Systems. Addison-Wesley, 1993. Google ScholarDigital Library
- 4.D. Hatley and I. A. Pirbhai. Strateaies for Real-Time System Specification. Dorset House, 1987. Google ScholarDigital Library
- 5.I. Jacobson. Obiect-oriented Software Engineering Addison- Wesley, Reading, MA, 1992. Google Scholar
- 6.N. L. Kerth and W. Cunningham. Using patterns to improve our architectural vision, IEEE Software Jan./Feb. 1997,53-59 Google ScholarDigital Library
- 7.R. G. Lavender and D. C. Schmidt. Active object: An object behavioral pattern for concurrent programming, Proc. 2nd Annual Conference on the Pattern Lanrmarzs of Proarams, Monticello, IL Sept. 1995Google Scholar
- 8.D. Lea. Concurrent proarammina in Javam. Addison-Wesley, 1997Google Scholar
- 9.T. Minoura. S. S. Pargaonkar, K. Rehfuss. Structural active object systems for simulation, OOPSLA 1993,338-355 Google ScholarDigital Library
- 10.R. T. Monroe, A. Kompanek, R. Melton and D. GarIan. Architectural styles, design patterns and objects, IEEE Software Jan./Feb. 1997.43-52 Google ScholarDigital Library
- 11.K. W. Nielsen and K. Shumate. Designing large real-time systems with Ada. Communications of the ACM, 30:8 (August 1987) 695-715. Corrected in CACM 30:12 (December 1987) 1073 Google ScholarDigital Library
- 12.B. I. Sander. Entity-life modeling and structured analysis in real-time software design - a comparison. Communications of the AcM. 32:12 (December 1989) 1458-1466. Google ScholarDigital Library
- 13.B. I. Sanden. Software Svstems Construction with Examples in Ada Prentice-Hall, 1994. A Google ScholarDigital Library
- 14.B. I. Sanden. Designing control systems with Entity-life modeling Journal of Svstems and Software, 28 (April 1995) 225- 237. Google ScholarDigital Library
- 15.B. I. Sanden. Using tasks to capture problem concurrency. Ada User Journal, 17:l (March 1996) 25-36Google Scholar
- 16.B. I. Sanden. Entity-life modeling in a distributed environment. Proc. Fourth International Workshop on Parallel and Distributed Real-Time Svstems. Honolulu. HI, April 1996,35-41. Google ScholarDigital Library
- 17.B. I. Sanden The State Machine pattern. Proc. TRI-Ada, Philadelphia. PA, Dec, 1996, 135 - 142. Google ScholarDigital Library
- 18.B. I. Sanden. A course in real-time software design based on Ada 95, Available through the ASSET repository as ASSET-A-825, 1996. http//www.asset.com/WSRD/abstracts/ ABSTRACT-825.htmlGoogle Scholar
- 19.B. I Sanden. Modeling concurrent software. IEEE Software Sept/Oct 1997. Google ScholarDigital Library
- 20.B. l. Sanden. Case studies of concurrent real-time systems, 1997, http://www.isse.gmu.eddulfaculty/bsanden/rtexamples.htmlGoogle Scholar
- 21.K. Shumate and M. Keller. Software Specification and Design: A Disciplined Approach for Real-Time &stems, Wiley 1992 Google ScholarDigital Library
- 22.H. Simpson. The MASCOT method. IEE/BCS Software Engineering Journal, 1:3 (1986) 103-120. Google ScholarDigital Library
- 23.P. Stenstriim and F. Dahlgren. Applications for shared memory multiprocessors. IEEE Commuter 29:12 (Dec. 1996) 29-31 Google ScholarDigital Library
- 24.J.-E. Stromberg. Styming av LEGO-bilfabrik. Laboration i digital styming. Liinkiipings Tekniska Hiigskola, 1991.Google Scholar
- 25.S. J. Young. Real-time Lanmraaes: Design and Development, Ellis Horwood, Chichester, West Sussex, England 1982. Google ScholarDigital Library
Index Terms
- Concurrent design patterns for resource sharing
Recommendations
Type-safe concurrent resource sharing
Concurrent systems often have many processes sharing a common set of resources, both memory regions and hardware devices. Among the many challenges in producing safe concurrent software are single access, atomic transactions, starvation, and deadlock. ...
A concurrent algorithm for avoiding deadlocks in multiprocess multiple resource systems
SOSP '71: Proceedings of the third ACM symposium on Operating systems principlesIn computer systems in which resources are allocated dynamically, algorithms must be executed whenever resources are assigned to determine if the allocation of these resources could possibly result in a deadlock, a situation in which two or more ...
Fine-grained resource sharing for concurrent GPGPU kernels
HotPar'12: Proceedings of the 4th USENIX conference on Hot Topics in ParallelismGeneral purpose GPU (GPGPU) programming frameworks such as OpenCL and CUDA allow running individual computation kernels sequentially on a device. However, in some cases it is possible to utilize device resources more efficiently by running kernels ...
Comments