21. Linux Magazine | April 2001 | COMPILE TIME | More Concurrent Programming Topics COMPILE TIME More concurrent programming Topics by Benjamin Chelf.In the past two months we've introduced threads and mutexes, the http://www.linux-mag.com/2001-04/compile_01.html

LINUX MAGAZINE subscribe advertise customer service ... contacts Newsletter Email: Name: Sections Editorial Newbies Reviews Shutdown How To LAMP Post Power Tools Guru Guidance On The Desktop ... Best Defense Developer's Den Java Matters Extreme Linux Compile Time Perl of Wisdom ... Downloads Indexes Issue Archive Author Index On Stands Now Subscribe Now! Name: Address: City: State: XX (US only) Zip: Email: 12 issues for $29.95 24 issues for $54.95 Non-US orders? Click here for delivery to: Canada Mexico Other feedback ... COMPILE TIME More Concurrent Programming Topics page next >> COMPILE TIME More Concurrent Programming Topics by Benjamin Chelf In the past two months we've introduced threads and mutexes, the locking mechanism used to prevent race conditions in threaded applications. In this month's column, we'll look at two types of concurrent programming techniques used to synchronize the execution of code in threads. Hopefully, this discussion will further your perception of locks and how they are used in concurrent programming. Recall that a mutex is a lock that only one thread can "hold" at any given time. If a thread tries to acquire the lock while another thread "holds" it, that thread will be blocked until the lock is released. This mechanism is quite helpful when you want only one thread executing certain code at a given time (for example, when a common variable's value is read and then written).

22. Linux Magazine | March 2002 | FEATURE | Common Concurrent Programming Errors FEATURE Common concurrent programming Errors Things can get tricky whena program runs in multiple threads. by Henry Gabb. Concurrent http://www.linux-mag.com/2002-03/concurrent_01.html

LINUX MAGAZINE subscribe advertise customer service ... contacts Newsletter Email: Name: Sections Editorial Newbies Reviews Shutdown How To LAMP Post Power Tools Guru Guidance On The Desktop ... Best Defense Developer's Den Java Matters Extreme Linux Compile Time Perl of Wisdom ... Downloads Indexes Issue Archive Author Index On Stands Now Subscribe Now! Name: Address: City: State: XX (US only) Zip: Email: 12 issues for $29.95 24 issues for $54.95 Non-US orders? Click here for delivery to: Canada Mexico Other feedback ... March 2002 / FEATURE Common Concurrent Programming Errors page next >> FEATURE Common Concurrent Programming Errors Things can get tricky when a program runs in multiple threads. by Henry Gabb C oncurrent programming has been around for a long time. Programmers have typically used threads to express concurrency. Mapping independent tasks to threads gives the operating system greater flexibility in scheduling, which helps hide program latency. While one thread waits for data, the operating system can run another. In addition, most systems are capable of doing computation and I/O simultaneously, provided that computation and I/O are independent tasks mapped to threads. With symmetric multiprocessors (SMP) becoming more common, programmers are starting to use threads to take advantage of the performance benefits of parallel computing. (For an introduction to threads and their uses, see the four-part "Compile Time" series mentioned in the Resources box.) Concurrency adds a temporal component to coding that can be confusing at first. It also makes debugging harder because errors can be difficult to reproduce. Fortunately, the same types of errors tend to appear over and over again. This article will try to show you what not to do, hopefully avoiding bugs in the first place (or at least making it easier to spot errors in existing programs). The concurrent programming errors described in this article are divided into two categories those causing data races and those causing deadlock. Most of the example programs sometimes execute correctly and sometimes don't. That's the difficulty of debugging concurrent programs. Multithreaded programs that work fine during testing often fail in the hands of the end-user.

23. On Concurrent Programming ACM! ACM2.gif (7501 bytes). On concurrent programming. by Fred Schneider.(from Communcations of the ACM , April 1998, p. 128. Reposted http://www.cs.cornell.edu/ugrad/FBS-Article.htm

Join the ACM! On Concurrent Programming by Fred Schneider (from "Communcations of the ACM", April 1998, p. 128. Reposted with the permission of the ACM Concurrent programs are notoriously difficult to get right. This is as true today as it was 30 years ago. But 30 years ago, concurrent programs would be found only in the bowels of operating systems, and these were built by specialists. Today, concurrent programs are everywhere and are being built by relatively inexperienced programmers: All sorts of application programmers write concurrent programs. Freezing up a PC when you pull down a menu or click on an icon is likely to be caused by a concurrent- programming bug in the application. Knowledge of operating system routines is no longer required to write a concurrent program. Java threads enable program-mers to write concurrent programs, whether for spiffy animation on Web pages or for applications that man-age multiple activities. A concurrent program consists of a collection of sequential processes whose execution is interleaved; the interleaving is the result of choices made by a scheduler and is not under programmer control. Lots of execution interleavings are possible, making testing of all but trivial concurrent programs infeasible. To make matters worse, functional specifications for concurrent programs often concern intermediate steps of the computation. For example, consider a word-processing program with two processes: one that formats pages and passes them through a queue to the second process, which controls a printer. The functional specification might stipulate that the page-formatter process never deposit a page image into a queue slot that is full and that the printer-control process never retrieve the contents of an empty or partially filled queue slot.

24. 308-409: Concurrent Programming 308409A concurrent programming. McGill University. Note The exam is openbook. That means you may bring your text(s) and whatever notes you wish. http://www.cs.mcgill.ca/~cs409/

308-409A: Concurrent Programming McGill University Note: The exam is open book. That means you may bring your text(s) and whatever notes you wish. You may also bring a calculator (though you shouldn't need one). You may not bring a PDA or laptop, or any device capable of wireless communication. Note: You can pick up assignment 5 today (Monday Dec 9) between 1:00pm and 2:30pm. The solution to question 1 is shown here Time and Place Instructor Teaching Assistants ... Course Syllabus Time and Place Monday, Wednesday, Friday: 10:35 - 11:25 Leacock 321 Instructor Clark Verbrugge Office: McConnell, room 230 Office hours (Fall term): Monday 13:00-14:30, Wednesday 8:30-10:00, or by appointment Phone: 398-2411 Email: clump@cs.mcgill.ca Once term has begun, please send course-related emails to cs409@cs.mcgill.ca . This will allow the TAs to respond as well. Teaching Assistant Dayong Gu Office: McConnell, room 229 Email: dgu1@cs.mcgill.ca Pre-requisites COMP 251 (Data Structures and Algorithms). COMP 302 (Programming Languages and Paradigms). COMP 310 (Computer Systems and Organization).

25. Lf281, SoftwareDevelopment: Concurrent Programming - Communication Between Proce concurrent programming communication between processes. AbstractThis series of articles has the purpose of introducing the reader http://www.linuxfocus.org/English/January2003/article281.shtml

Home Map Index Search ... About LF This article is available in: English Deutsch Francais Russian ... Convert to GutenPalm or to PalmDoc by Leonardo Giordani About the author: Student at the Faculty of Telecommunication Engineering in Politecnico of Milan, works as network administrator and is interested in programming (mostly in Assembly and C/C++). Since 1999 works almost only with Linux/Unix. Translated to English by: Leonardo Giordani Content Introduction SysV keys Semaphores Recommended readings ... Talkback form for this article Concurrent programming - communication between processes Abstract This series of articles has the purpose of introducing the reader to the concept of multitasking and to its implementation in the Linux operating system. Starting from the theoretical concepts at the base of multitasking we will end up writing a complete application demonstrating the communication between processes, with a simple but efficient communication protocol. Prerequisites for the understanding of the article are: Minimal knowledge of the shell Basic knowledege of C language (syntax, loops, libraries)

26. Lf272, SoftwareDevelopment: Concurrent Programming - Principles And Introduction concurrent programming Principles and introduction to processes.Abstract This series of articles has the purpose of introducing http://www.linuxfocus.org/English/November2002/article272.shtml

Home Map Index Search ... About LF This article is available in: English Castellano Deutsch Francais ... Convert to GutenPalm or to PalmDoc by Leonardo Giordani About the author: Student at the Faculty of Telecommunication Engineering in Politecnico of Milan, works as network administrator and is interested in programming (mostly in Assembly and C/C++). Since 1999 works almost only with Linux/Unix. Translated to English by: Leonardo Giordani Content Introduction The concept of process Processes in Linux and Unix Mutitasking in the libc ... Talkback form for this article Concurrent programming - Principles and introduction to processes Abstract This series of articles has the purpose of introducing the reader to the concept of multitasking and to its implementation in the Linux operating system. Starting from the theorical concepts at the base of multitasking we will end up writing a complete application demonstrating the communication between processes, with a simple but efficient communication protocol. Prerequisites for the understanding of the article are: Minimal knowledge of the shell Basic knowledege of C language (syntax, loops, libraries)

27. MultiLogo: A Study Of Children And Concurrent Programming MultiLogo A Study of Children and concurrent programming. Mitchel Whatfactors influence the learning of concurrent programming? What http://llk.media.mit.edu/papers/1991/MultiLogo.html

MultiLogo: A Study of Children and Concurrent Programming Mitchel Resnick Epistemology and Learning Group The Media Laboratory Massachusetts Institute of Technology 20 Ames Street Room E15-312 Cambridge, MA 02139 mres@media.mit.edu Published in Interactive Learning Environments , vol. 1, no. 3 (1990). Abstract During the past decade, computer scientists have developed dozens of concurrent (or parallel ) programming languagues. These languages hold the promise of opening up exciting new applications for computers. But that will happen only if people can effectively learn, use, and understand these new languages. To explore these issues, I developed a concurrent extension to Logo (called MultiLogo), and I conducted an experimental study with a group of elementary-school students. The students used MultiLogo to control simple robotic devices built out of LEGO bricks. In analyzing the children's work, I develop three primary categories of MultiLogo programming bugs: problem-decomposition bugs, synchronization bugs, and object-oriented bugs. Based on the results, I recommend ways to improve the design and teaching of concurrent programming languages for non-experts. 1. Introduction

28. Addison-Wesley concurrent programming in Java™ Design Principles and Pattern ,Second Edition. View Larger Image. Douglas Lea List price $44.99 http://www.awprofessional.com/catalog/product.asp?product_id={3BADE5EF-2784-48BF

29. Parallel Programming / Concurrent Programming - Addison Wesley / Benjamin Cummin Andrews, University of Arizona © 1991 / 08053-0086-4 / Addison-Wesley.Parallel Programming / concurrent programming. Featured Titles. http://www.aw.com/catalog/academic/course/1,4095,70057,00.html

Find Your Rep Publish with Us Customer Service Careers ... Statistics Sort by: Author Title New! Distributed Computing: Principles and Applications M.L. Liu, California Polytechnic State University / 0-201-79644-9 / Addison-Wesley Introduction to Parallel Computing, An: Design and Analysis of Algorithms, 2/E Ananth Grama, Purdue University Vipin Kumar, University of Minnesota Anshul Gupta, IBM TJ Watson Research Center George Karypis, University of Minnesota / 0-201-64865-2 / Addison-Wesley Foundations of Multithreaded, Parallel, and Distributed Programming Gregory R. Andrews, University of Arizona / 0-201-35752-6 / Addison-Wesley Concurrent Systems: An Integrated Approach to Operating Systems, Database, and Distributed Systems, 2/E Jean Bacon, University of Cambridge / 0-201-17767-6 / Addison-Wesley Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering Ian Foster, Argonne National Laboratory / 0-201-57594-9 / Addison-Wesley Concurrent Programming: Principles and Practice Greg Andrews, University of Arizona / 0-8053-0086-4 / Addison-Wesley Parallel Programming / Concurrent Programming Featured Titles Distributed Computing: Principles and Applications Available NOW: M.L. Liu

30. Concurrent Programming In Java™: Design Principles And Pattern, 2/E - Addi RELATED TITLES. Parallel Programming / concurrent programming (Computer Science).concurrent programming in Java™ Design Principles and Pattern, 2/E. http://www.aw.com/catalog/academic/product/1,4096,0201310090,00.html

Find Your Rep Publish with Us Customer Service Careers ... Statistics ABOUT THIS PRODUCT Description Table of Contents About the Author(s) RELATED TITLES Parallel Programming / Concurrent Programming (Computer Science) View Larger Image Douglas Lea ISBN: 0-201-31009-0 Publisher: Addison Wesley Professional Format: Paper; 432 pp Published: 10/25/1999 Status: Instock US: $44.99 You Save: $4.50 (10% off) Our Price: $40.49 Add to Cart Instructor Exam Copy Description One of Java's most powerful capabilities is its built-in support for concurrent programming, a design technique in which multiple concurrent activities-threads take place inside a single Java program. Thread programming enables developers to design applications that are more responsive to user demands, faster, and more easily controlled. AW Higher Education Group , a division of Pearson Education , a Pearson . E-mail webmaster@awl.com

31. Concurrent Programming concurrent programming. http://erlang.org/course/concurrent_programming.html

Concurrent Programming Definitions Creating a new process Simple message passing An Echo Process ... Timeouts Definitions Process - A concurrent activity. A complete virtual machine. The system may have many concurrent processes executing at the same time. Message - A method of communication between processes. Timeout - Mechanism for waiting for a given time period. Registered Process - Process which has been registered under a name. Client/Server Model - Standard model used in building concurrent systems. back to top Creating a New Process Before: Code in Pid1 Pid2 = spawn(Mod, Func, Args) After Pid2 is process identifier of the new process - this is known only to process Pid1. back to top Simple Message Passing - returns the Process Identity (Pid) of the process executing this function. From and Msg become bound when the message is received. Messages can carry data. Messages can carry data and be selectively unpacked. The variables A and D become bound when receiving the message. If A is bound before receiving a message then only data from this process is accepted. back to top An Echo process back to top Selective Message Reception The message foo is received - then the message bar - irrespective of the order in which they were sent.

32. Concurrent Programming concurrent programming. Lecturer Prof. Oscar Nierstrasz. Course Contents.This course provides an introduction to concurrent programming with Java. http://www.iam.unibe.ch/~scg/Teaching/CP/

Concurrent Programming NB: This is the web page of the 2001 instantiation of this course. To be updated for WS 2003. Lecturer: Prof. Oscar Nierstrasz Assistants: Franz Achermann Nathanael Schaerli Time: Mondays 10h15 - 12h00 Place: IWI 001 Start: Course Contents This course provides an introduction to concurrent programming with Java. The course focuses on fundamental concepts important for developing correctly functioning concurrent programs, such as saftey, liveness and fairness, and on standard programming patterns and techniques for dealing with these issues. The course will include two lab sessions (replacing the regular lecture hours) in which students will work in small groups to apply the techniques presented. Much of the practical material in this lecture will be based on: Doug Lea, Concurrent Programming in Java: Design Principles and Patterns , Addison-Wesley, 1996 The theoretical foundations will be based on: Jeff Magee and Jeffrey Kramer

33. Concurrent Programming Issues - Whitepaper California Software technologies tools. The paper presents the most commonly used concurrentprogramming techniques as solutions to avoid emergent effects. http://www.cswl.com/whiteppr/white/concurrent.html

34. Concurrent Programming In ERLANG - Armstrong, Williams, Virding (ResearchIndex) time systems Carlson (2002) (Correct) Active bibliography (related documents)More All 2.0 concurrent programming in ERLANG - Second Edition (Correct) 0.3 http://citeseer.nj.nec.com/armstrong93concurrent.html

Concurrent Programming in ERLANG (1993) (Make Corrections) (188 citations) Joe Armstrong, et al. Home/Search Context Related View or download: erlang.se/publicat angbookpart1.pdf Cached: PS.gz PS PDF DjVu ... Help From: erlang.se/publicati index.shtml (more) Homepages: J.Armstrong HPSearch (Update Links) Rate this article: (best) Comment on this article (Enter summary) Abstract: Syntax Notation One (ASN.1), Recommendation X.208, Geneva, Switzerland. [13] CCITT Specification of Basic Encoding Rules (BER for Abstract Syntax One (ASN.1), Recommendation X.209, Geneva, Switzerland. [14] Gray, Jim and Reuter, Andreas Transaction Processing Concepts and Techniques, Morgan Kaufmann Publishers, 1993. 143 144 Bibliography ... (Update) Context of citations to this paper: More projects: JOpt [9] and JoGa, Java class file optimisers, and [12] a tool for reverse engineering of communication protocols of Erlang applications. Currently, we use the framework for an empirical study of basic block graph and flow graph performance. Structure of... ...our work we make use of these program models for program visualization and model checking. 1.

35. Citations: Concurrent Programming : Principles And Practice - Andrews (ResearchI concurrent programming Principles and Practice. GA Andrews, concurrent programming,Principles and Practice , Benjamin/Cummings Publishing Company, 1991. http://citeseer.nj.nec.com/context/32075/0

82 citations found. Retrieving documents... G. A. Andrews, " Concurrent Programming, Principles and Practice ", Benjamin/Cummings Publishing Company, 1991. Home/Search Document Not in Database Summary Related Articles Check This paper is cited in the following contexts: First 50 documents Next 50 Process Calculi at work - An account of the LCS project - Berthomieu (1995) (1 citation) (Correct) ....the type system of LCS and its implementation can be found in [2, 3] 5 3. Programming with LCS, A complete example Region Labelling LCS programming is illustrated in this section by a simple image processing example known as region labeling. The description of the problem is adapted from An image is a matrix (assumed square here) of pixels, each being assigned a light intensity. A region is a set of neighboring pixels having the same light intensity. The region labelling problem is that of identifying the regions of a picture and assigning a region label to each of its pixels. .... ....is not a production solution however: Though we could run it satisfactorily on images of size up to 100x100 pixels on a typical workstation, that solution is quite space consuming. A production version would preferably implement a hierarchical version of the above algorithm, as described in

36. HUT - TKO - T-106.420 Concurrent Programming (3 Cr) P T106.420 - concurrent programming (3 cr) P. Suomeksi Svenska TeacherEndre Domiczi. Assistant David Litkey. Contents Principles http://www.cs.hut.fi/Studies/T-106.420/

T-106.420 - Concurrent Programming (3 cr) P Suomeksi Svenska Teacher: Endre Domiczi Assistant: David Litkey Contents: Principles of concurrent programming, synchroniza-tion and communication mechanism semantics and realization. Concurrent and distributed algorithms. Prerequisites: T-106.233 or T-106.270 Literature: Gregory R. Andrews: Foundations of Multithreaded, Parallel, and Distributed Programming, Addison-Wesley, 2000 ISBN 0-201-35752-6 Requirements: Examination and exercices. Additional information: Replaces Tik-76.166 Homepage: main.html This page is maintained by the course personnel , E-mail: david.litkey@cs.hut.fi This page has been updated last on the 8.1.2002 19:00. URL: http://www.cs.hut.fi/Studies/T-106.420/index.html

37. Slashdot | Review:Concurrent Programming In Java: Design Principles And Patterns Review concurrent programming in Java Design Principles and Patterns.Java Rating 8/10. A Book on concurrent programming. Concurrent http://slashdot.org/books/98/11/20/0920259.shtml

OSDN Devchannel Newsletters Shop Slashdot All OSDN Sites freshmeat DevChannel Linux.com NewsForge OSDN.com Slashcode SourceForge.net X faq code awards ... hof Sections apache Apr 2 (1 recent) apple Apr 2 (7 recent) askslashdot Apr 4 (5 recent) books Apr 3 (2 recent) bsd Apr 3 (1 recent) developers Apr 3 (6 recent) features Mar 26 games Mar 27 interviews Mar 31 radio Jun 29 science Apr 3 (9 recent) yro Apr 3 (10 recent) Review: Concurrent Programming in Java: Design Principles and Patterns Posted by Hemos on Friday November 20, @04:20AM Veteran reviewer SEGV has sent in his latest literary exploit, a review of Doug Lea's book Concurrent Programming in Java: Design Principles and Patterns . Not exactly a book for the beginning, this is design for those of you who know their way around Java, and are looking to firm up your theory base. Given the recent lawsuit end, it appears that a lot more attention is being focused on Java again. Let's trya nd get some real programming done for it. Concurrent Programming in Java: Design Principles and Patterns, by Doug Lea [Addison-Wesley, ISBN 0-201-69581-2]

38. Concurrent Programming Chapter 1 concurrent programming. Joinpattern synchronization can expressmany common programming paradigms, either concurrent or sequential. http://pauillac.inria.fr/jocaml/htmlman/manual002.html

Chapter 1 Concurrent programming This part of the manual is a tutorial introduction to JoCaml. This chapter presents small, local examples. Chapter deals with the distributed features. It is assumed that the reader has some previous knowledge of Ocaml. 1.1 Conventions Examples are given as JoCaml source, followed by the output of the top-level (or of the compiler when prompted to print types). The JoCaml top-level provides an interactive environment, much as the Ocaml top-level. In order to try the examples, you can either type them in a top-level, launched by the command joctop , or concatenate the sources chunks in some file a.ml then compile a.ml by the command joc -i a.ml , and finally run the produced code by the command ./a.out . (Option -i enables the output of inferred types). 1.2 Basics Jocaml programs are made of processes and expressions . Roughly, processes are executed asynchronously and produce no result, whereas expressions are evaluated synchronously and their evaluation produces values. For instance, OCaml expressions are JoCaml expressions. Processes communicate by sending messages on channels (a.k.a. port names). Messages carried by channels are made of zero or more values, and channels are values themselves. In contrast with other process calculi (such as the pi-calculus and its derived programming language Pict), channels and the processes that listen on them are defined in a single language construct. This allows considering (and implementing) channels as functions when they have the same usage.

39. A Study Guide For Concurrent Programming A Study Guide for concurrent programming in Java™. Version 1.1,Quick Links. Lea. concurrent programming in Java™ 2nd Edition. http://home.adelphia.net/~nikboyd/papers/concurrent/concurrent.guide.htm

40. GBC/ACM Spring 1998 Professional Development Seminar Schedule Return to GBC/ACM Home Page. concurrent programming in Java. Doug Lea will presenttechniques for effective concurrent programming in Java. Who Should Attend. http://www.acm.org/chapters/gbc/pds-s98.html

GBC/ACM Professional Development Seminar Schedule Latest Update: March 18, 1998. Concurrent Programming in Java Doug Lea, March 14,1998 Transaction Processing Overview The C++ Standard Library Bjarne Stroustrup, April 4,1998 Please note that attendance at all seminars is limited by the space available. If you are pre-registering at short notice or plan to walk-in, check this Web site or call our answering machine at 781-862-1181 to see if space is still available. Where, When, How Much? Registration Form Coming soon: PDS Brochure in Acrobat (.PDF) form. Acknowledgments GBC/ACM gratefully acknowledges our PDS benefactors: For donation of venue and logistics support: Northeastern University College of Computer Science Northeastern University College of Engineering For donations of gift certificates and other items for volunteer recruitment: Quantum Books, Cambridge, MA Softpro Book Store, Burlington, MA For donations of database software: Commence Corporation, Shrewsbury, NJ Return to GBC/ACM Home Page. Concurrent Programming in Java Doug Lea, State University of New York at Oswego

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 2     21-40 of 95    Back | 1  | 2  | 3  | 4  | 5  | Next 20