Geometry.Net - the online learning center
Home  - Basic_C - Concurrent Programming

e99.com Bookstore
  
Images 
Newsgroups
Page 3     41-60 of 95    Back | 1  | 2  | 3  | 4  | 5  | Next 20
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  

         Concurrent Programming:     more books (100)
  1. Objects for Concurrent Constraint Programming (The Springer International Series in Engineering and Computer Science) by Martin Henz, 1997-10-31
  2. Concurrent Programming for Software Engineers (Ellis Horwood Series in Computers and Their Applications) by Dick Whiddett, 1987-09
  3. Concurrent programming in occam 2 (Ellis Horwood series in computers and their applications) by John Wexler, 1989
  4. Object-Oriented Concurrent Programming (Artificial Intelligence) by Akinori Yonezawa, Mario Tokoro, 1987-04-14
  5. Concurrent Programming (International Computer Science Series) by Narain Gehani, 1988-03
  6. Whiddett: Concurrent Programming for Software Engineers (Paper) by Richard John Whiddett, 1987-09-16
  7. Ada: Concurrent Programming by Narain Gehani, 1991-01
  8. Non-Deterministic Concurrent Logic Programming in Pandora (World Scientific Series in Computer Science) by Reem Bahgat, 1993-09
  9. The Origin of Concurrent Programming: From Semaphores to Remote Procedure Calls
  10. Concurrent Information Processing and Computing (NATO Science) by Dan Grigoras, Romania) NATO Advanced Research Workshop on Concurrent Information Processing and Computing (2003 : Sinaia, et all 2005-05-31
  11. Theory and Practice of Parallel Programming: International Workshop TPPP '94, Sendai, Japan, November 7-9, 1994. Proceedings (Lecture Notes in Computer Science)
  12. Open Multithreaded Transactions: A Transaction Model for Concurrent Object-Oriented Programming by Jörg Kienzle, 2010-11-02
  13. Object-Based Models and Languages for Concurrent Systems: ECOOP '94 Workshop on Models and Languages for Coordination of Parallelism and Distribution, ... Papers (Lecture Notes in Computer Science)
  14. Concurrent Engineering: Tools and Technologies for Mechanical System Design (NATO ASI Series / Computer and Systems Sciences)

41. Concurrent Programming
This research is concerned with the development of very fast parallel algorithms,ones faster than those available through normal programming techniques or
http://www.algorithms.org/MoinMoin/wiki-moinmoin/moin.cgi/Concurrent_20Programmi
Concurrent Programming UserPreferences
algorithms.org
FrontPage ... Help
Links
Catai
http://wonderland.dia.unisa.it/catai/
Catai is an algorithm animation system that relies on distributed object technologies. Ultrafast Parallel Algorithms and Reconfigurable Meshes
http://www.eecs.umich.edu/~qstout/abs/DARPA92.html
This research is concerned with the development of very fast parallel algorithms, ones faster than those available through normal programming techniques or standard parallel computers. EditText of this page (last modified 2001-10-23 00:41:01)
FindPage
by browsing, searching, or an index
Or try one of these actions: LikePages SpellCheck

42. The Joel On Software Forum - Threading/Concurrent Programming
Discussion Board Search Threading/concurrent programming. Can anyone pleaserecommend some good texts that teach you how to do threading properly?
http://discuss.fogcreek.com/joelonsoftware/default.asp?cmd=show&ixPost=8857

43. COMP421
COMP 421 Operating Systems and concurrent programming. Spring 2002.This course is intended to provide a basic understanding of the
http://www.owlnet.rice.edu/~comp421/
This page had moved to this location.

44. Extending Java To Support Shared Resource Protection And Deadlock Detection In T
Java threads enable programmers to write parallel programs very easily and conveniently. However, the current Java specification does not adequately provide for the protection of shared resources or for deadlock detection, two of the most common problems arising from parallel programs. The ability to solve these problems is crucial for Java concurrent programming. In this paper, we introduce and implement a model that can aid in writing parallel programs by providing shared resource protection and deadlock detection. Published in Crossroads, the ACM student magazine.
http://www.acm.org/crossroads/xrds4-2/dynac.html
ACM Crossroads Student Magazine
The ACM's First Electronic Publication Crossroads Home
Join the ACM!

Search Crossroads

crossroads@acm.org
... Crossroads
Extending Java to Support Shared Resource Protection and Deadlock Detection in Threads Programming
by
Anita J. Van Engen

Michael K. Bradshaw

Nathan Oostendorp
Abstract
Java threads enable programmers to write parallel programs very easily and conveniently. However, the current Java specification does not adequately provide for the protection of shared resources or for deadlock detection, two of the most common problems arising from parallel programs. The ability to solve these problems is crucial for Java concurrent programming. In this paper, we introduce and implement a model that can aid in writing parallel programs by providing shared resource protection and deadlock detection.
Introduction
The increasing use of parallel systems and programs in many different fields has brought new attention to how threads cooperate and share data. Parallel programs are used in such critical and sensitive environments as database operation and manipulation, data collection and system maintenance tasks. With an increasing emphasis being placed on the World Wide Web and on platform-independent tools, Java is positioned to become the language of choice for many applications, including parallel programming. While it provides some solid facilities for basic threads programming, Java does not adequately provide for shared resource protection or have the ability to detect deadlock. Adequate Java support for these features would make Java threads even more effective for parallel programming.

45. OOPSLA 2002 –– Final Program -- Introduction To Concurrent Programming In Java
602. 25 Introduction to concurrent programming in Java. applications.However concurrent programming poses many traps for the unwary.
http://oopsla.acm.org/fp/files/tut-25.html

Tracks

Technical Program

Tutorials

Workshops
...
Transportation
Introduction to Concurrent Programming in Java David Holmes
DLTeCH Pty Ltd dholmes@dltech.com.au
Doug Lea
State University of New York (SUNY) at Oswego dl@cs.oswego.edu Concurrent programming has mostly been the domain of systems programmers rather than application developers, but Java's support of concurrency has enticed many to try their hand at concurrent applications. However concurrent programming poses many traps for the unwary. This tutorial demonstrates various design patterns and techniques for constructing concurrent applications in Java and for managing that concurrency. On the language side we look at Java's mechanisms to support concurrent programming. On the design side we look at object structures and design rules that can successfully resolve the competing forces (safety, liveness, efficiency, coordination, reusability) present in concurrent software design problems.
Attendee background
This tutorial targets anyone involved, or planning to get involved, in the development of concurrent object-oriented applications. It is assumed that the attendee is familiar with basic OO concepts and has a working knowledge of the Java programming language.
Format
Lecture based
Presenters
David Holmes is Director and Chief Scientist at DLTeCH Pty Ltd, located in Brisbane, Australia. His work with Java technology has focused on concurrency and synchronization support in the language and virtual machine and he is currently working on a real-time Java virtual machine. David has presented tutorials on concurrent Java programming and design at numerous international object-oriented programming conferences. He is a co-author of the book "The Java Programming Language" (third edition). David completed his Ph.D. at Macquarie University, Sydney, in 1999.

46. Nilsen Elektronikk As
Makes 2 very small, open source realtime OSs for embedded systems, written in C proc RealTime Kernel, preemptive, mature; nesos Finite State Machine Operating System (FSMOS), modular, use concurrent programming methods in little time and space. Also nemon Boot and Debug Monitor; Embedded Web Servers.
http://www.nilsenelektronikk.no/
Consultancy
Services

o
Real-time systems
Embedded web-servers
Connecting small widgets
to Ethernet
o
Linux Device Drivers
Embedded Linux
o Development of Digital and Analogue Hardware FPGA design with VHDL o Free Embedded Products Consultancy Services Friends Contact Info ... Meet the Crew Download Free RTOS Compact and efficient RTOS for embedded systems. Several different architectures. Source included. More Freeware: FSM Operating System Boot and Debug Monitor Embedded Web Server ... Norsk Web og Applet design: nilsen elektronikk as

47. OOPSLA 2002 –– Advance Program -- Introduction To Concurrent Programming In Ja
Tuesday, 5 November – 8301200 Morning. 25 Introduction to concurrent programmingin Java. However concurrent programming poses many traps for the unwary.
http://oopsla.acm.org/ap/files/tut-25.html

Tracks

Technical Program

Tutorials

Workshops
...
Transportation
Introduction to Concurrent Programming in Java David Holmes
DLTeCH Pty Ltd dholmes@dltech.com.au
Doug Lea
State University of New York (SUNY) at Oswego dl@cs.oswego.edu Concurrent programming has mostly been the domain of systems programmers rather than application developers, but Java's support of concurrency has enticed many to try their hand at concurrent applications. However concurrent programming poses many traps for the unwary. This tutorial demonstrates various design patterns and techniques for constructing concurrent applications in Java and for managing that concurrency. On the language side we look at Java's mechanisms to support concurrent programming. On the design side we look at object structures and design rules that can successfully resolve the competing forces (safety, liveness, efficiency, coordination, reusability) present in concurrent software design problems.
Attendee background
This tutorial targets anyone involved, or planning to get involved, in the development of concurrent object-oriented applications. It is assumed that the attendee is familiar with basic OO concepts and has a working knowledge of the Java programming language.
Format
Lecture based
Presenters
David Holmes is Director and Chief Scientist at DLTeCH Pty Ltd, located in Brisbane, Australia. His work with Java technology has focused on concurrency and synchronization support in the language and virtual machine and he is currently working on a real-time Java virtual machine. David has presented tutorials on concurrent Java programming and design at numerous international object-oriented programming conferences. He is a co-author of the book "The Java Programming Language" (third edition). David completed his Ph.D. at Macquarie University, Sydney, in 1999.

48. Doug Lea's Workstation
Author of concurrent programming in Java Design Principles And Patterns. There's a good collection of resources to Java, Object Oriented Programming and Design Patterns. Also, Lea's util.concurrent Java concurrency library is available here, as Public Domain.
http://gee.cs.oswego.edu/dl/
Doug Lea's Home Page
Surface mail: Doug Lea, Computer Science Department State University of New York at Oswego Oswego dl@cs.oswego.edu ... bookmarks
Documents
Books
Software
Teaching
Patterns-related documents

49. PPXT Concurrent Programming VT03
PPVT concurrent programming VT03. Read this interesting page on the risks of incorrectconcurrent programming; 2003-01-30 OBS! Correction in the schedule.
http://www.cs.chalmers.se/ComputingScience/Education/Courses/ppvt/
PPVT - Concurrent Programming VT03
Latest News and General Information
  • 2003-03-31 The exam correction has been somewhat delayed because of Prasads hospitalization. We hope to be finished with it tomorrow.
  • 2003-03-05 A sheet with sample exam questions is available. Last years exam with solution suggestions is available. We have added a reading guide that lists the parts of the course covered by the course. 2003-02-25 There has been some additions to the schedule. This week there will be combined exercises and lab assistance on Thursday and Friday. Prasad will be avilable at Thursday 13-15 to assist you wil the third laboration. Please note that it is only Prasad who will help you with this the 3rd assignment. See the schedule 2003-02-13 Change of schedule, From now on, on Thursday, Prasad will be available in his office instead of outside MD2, 10.30-11.30,15.00-16.00. 2003-02-12 Some chnges to the Java Bridge (excercise 3) 2003-02-12 Extra hours of lab assistance this friday (14/02). Anders is available in room I,J, 13-17. Read this interesting page on the risks of incorrect concurrent programming 2003-01-30 OBS! Correction in the

50. Lyric Concurrent Programming Language
Lyric is a concurrent programming language, which is under development atMyricom for use on multicomputers based on Myricom's LANai chipset.
http://www.myri.com/lyric/
Lyric is a concurrent programming language, which is under development at Myricom for use on multicomputers based on Myricom's LANai chipset. While every effort is being made to provide prototype software and documentation consistent with the future versions of lyric, the prototype software and documentation provided here are subject to change without notice.
Compiler
The lyric compiler, which is a modified version of gcc-2.7.2 is available as a gzipped tar file The lyric compiler is installed just as gcc using prefix to specify where the compiler should be installed, as follows: configure prefix= prefix make install Only the SPARC architecture is currently supported. This installation process has only be tested under SunOS4.1.3 using Gnu make. Installation might work under Solaris on a SPARC, but this hypothesis is untested. For some newer flavors of SunOS, you must use instead of make install . Please report any installation problems to Myricom's lyric maintainers at lyric@myri.com The Lyric compiler source contains the lyric runtime system library and all header files needed to compile and run lyric programs, and should install them automatically. In the runtime system included with this compiler, "Class processes" are not implemented exactly as described in the lyric documentation below. Classes are implemented as objects rather than processes. Consequently, you may only invoke class methods synchronously, and class objects cannot use the active/passive mechanisms. This discrepancy does not affect the examples presented in the documentation, but can cause fatal runtime-system errors if these class objects attempt to send messages larger than about 100 bytes. (Instance processes may send any size message, however, within the limits of available memory.)

51. Concepts Of Concurrent Programming
Concepts of concurrent programming. Curriculum Module. Bustard, D. (Universityof Ulster). A concurrent program is one defining actions
http://www.sei.cmu.edu/publications/documents/cms/cm.024.html
Welcome Search SEI Publications About SEI Documents Lists of SEI Documents Recent Reports Featured
Articles
Publications news@sei
Addison-Wesley
Concepts of Concurrent Programming
Curriculum Module Bustard, D. (University of Ulster) A concurrent program is one defining actions that may be performed simultaneously. This module discusses the nature of such programs and provides an overview of the means by which they may be constructed and executed. Emphasis is given to the terminology used in this field and the underlying concepts involved.
SEI-CM-24 download the PostScript file
The Software Engineering Institute (SEI) is a federally funded research and development center sponsored by the U.S. Department of Defense and operated by Carnegie Mellon University. by Carnegie Mellon University
URL: http://www.sei.cmu.edu/publications/documents/cms/cm.024.html
Last Modified: 13 March 2003

52. Bookpool: Concurrent Programming
concurrent programming OutOf-Stock. concurrent programming C. Snow / Cambridge UniversityPress / 1990 / 0521339936 Our Price $18.50 ~ You Save $6.50 (26% Off),
http://www.bookpool.com/.x/darb4isml4/ss/L?su=cnc

53. Bookpool: The Origin Of Concurrent Programming: From Semaphores To Remote Proced
The Origin of concurrent programming From Semaphores to Remote Procedure Calls, Includes a bibliography of 160 papers and books on concurrent programming.
http://www.bookpool.com/.x/affj9bzkz1/sm/0387954015
0 items Search Subjects New Books ... LogOut Search: Browse: Business and Culture Certification Computer Applications Databases Distributed Computing Enterprise Computing Graphics and Multimedia Hardware Networking / Comm Operating Platforms Other Topics Programming Programming Languages WWW and Internet Apr 4, 2003 EST
The Origin of Concurrent Programming: From Semaphores to Remote Procedure Calls
Per Brinch Hansen
Springer-Verlag, Hardcover, Published October 2002, 534 pages, origin_con_pr, ISBN 0387954015 List Price: $69.95
Our Price:
You Save: $15.45 (22% Off)
Availability: In-Stock Be the First to Write a Review and tell the world about this title! Books on similar topics, in bestseller order: Books from the same publisher, in bestseller order: Publisher Summary of Title This book is a collection of original papers written by the computer scientists who made the major breakthroughs in concurrent programming. It covers the pioneering era of the field, from the semaphores of the mid 1960s to the remote procedure calls of the late 1970s.
"The Origin of Concurrent Programming" presents 19 seminal papers by E. W. Dijkstra, P. Brinch Hansen, and C. A. R. Hoare.

54. Mulle KybernetiK - Concurrent Programming, A Quick Refresher
Mulle kybernetiK Tech Info v0.0. Obj-C Optimization concurrent programming,a quick refresher. concurrent programming, a quick refresher.
http://www.mulle-kybernetik.com/artikel/Optimization/opti-4-refresher.html
Mulle kybernetiK - Tech Info: v0.0 Obj-C Optimization: Concurrent Programming, a quick refresher This sixth installment of the ongoing series "This is just a quick refresher on concurrent programming: Why ++myVariable is not thread safe.. (c) 2002 Mulle kybernetiK - text by Nat!
Concurrent Programming, a quick refresher
As you know, you should protect shared mutable data with locks as explained in Cocoa/TasksAndConcepts/ProgrammingTopics/Multithreading . Even just incrementing a global variable is not thread safe at all. This one C-instruction is actually executed with three or more PPC instructions that look similar or identical to this: lwz r11,0(r9) addi r0,r11,1 stw r0,0(r9) While each PPC instruction is executed there is a possibility that an interrupt occurs. The processing of this thread will then be suspended and the processor's attention will be focused on another thread. This other thread might very well now execute the same code trying to access the same global variable! To show how this can be disastrous, lets examine two cases where two threads execute the same code. In the first example the context switch to the second thread is harmless, because the increment statements have completed:

55. Concurrent Programming In ML (Abstract)
concurrent programming in ML (Abstract). Programs written in functionallanguages seldom use side effects. This makes functional
http://www.eecs.harvard.edu/~nr/pubs/concurrent-abstract.html
Concurrent programming in ML (Abstract)
Programs written in functional languages seldom use side effects. This makes functional programs good candidates for concurrent execution, since computations without side effects can proceed concurrently without interfering. Some side effects are required for I/O and communication; we can introduce them in a disciplined way by adding message-passing primitives to a functional language. Although ML is not purely functional, it is especially well suited to concurrent programming because it has a safe polymorphic type system and garbage collection. Following the examples of Pike's Newsqueak and Hoare's CSP, I have added concurrent primitives to ML, using the Standard ML of New Jersey compiler. The primitives provide dynamic creation of processes and channels and synchronous communication over channels. Input and output (to the Unix file system) is available on the same footing as communication over channels. I use SML-NJ's callcc and throw to simulate concurrent execution on a sequential machine. Concurrent programs can be structured as large collections of simple processes. I present several example processes. Because they are polymorphic (i.e. they operate on values of any type), these processes can be used in many programs. I present an application that uses these processes. I comment on the implementation and suggest how it might be extended to run on a multiprocessor. I show how the Standard ML modules system can be used to effect changes in the meanings of the primitives.

56. Concurrent Programming: Techniques, Algoirithms
next up previous Next Visual programming Up Academic work Previous Concurrentprogramming languages and. concurrent programming techniques, algoirithms.
http://matrix.research.att.com/vj/resume/node18.html
Next: Visual programming Up: Academic work Previous: Concurrent programming languages and
Concurrent programming: techniques, algoirithms
  • Eric Torng, Rajeev Motwani, and Vijay Saraswat ``Online algorithms for scheduling''.
  • Saraswat, V.A. et al. ``Detecting stable properties of networks in concurrent logic programming languages'', in Proceedings of the ACM Conference on Principles of Distributed Computing , Toronto, August 1988.
  • Vijay Saraswat ``Merging many streams efficiently: the importance of atomic commitment'', chapter in ``Concurrent Prolog: Collected Papers'', ed. E. Shapiro, MIT Press, December 1987.
    Vijay Saraswat
    Sun Sep 21 21:07:32 EDT 1997
  • 57. Semantic Foundations For Concurrent Programming
    Semantic foundations for concurrent programming. Vineet Gupta, Radha Jagadeesan,Vijay Saraswat. Probabilistic Concurrent Constraint Programming.
    http://matrix.research.att.com/vj/resume/node13.html
    Next: Real-time and Hybrid systems Up: Academic work Previous: Net communities
    Semantic foundations for concurrent programming
  • Vineet Gupta, Radha Jagadeesan, Vijay Saraswat. Probabilistic Concurrent Constraint Programming. Proceedings of CONCUR '97, edited by A. Mazurkiewicz and J. Winkowski, LNCS, Springer Verlag, 1997.
  • Vineet Gupta, Radha Jagadeesan, Vijay Saraswat. Models for Concurrent Constraint Programming. CONCUR'96: Concurrency Theory, edited by Ugo Montanari and Vladimiro Sassone, LNCS 1119, Springer Verlag, 1996.
  • Vineet Gupta, Radha Jagadeesan, Vijay Saraswat. Truly Concurrent Constraint Programming. CONCUR'96: Concurrency Theory, edited by Ugo Montanari and Vladimiro Sassone, LNCS 1119, Springer Verlag, 1996.
  • Ugo Montanari, Francesca Rossi, and Vijay Saraswat ``Event structure semantics for concurrent constraint programming'', 1994.
  • Ugo Montanari, Francesca Rossi, and Vijay Saraswat ``CC programs with both in- and non-determinism'', 1994.
  • Prakash Panangaden, Vijay Saraswat, Phillip J. Scott and Robert Seely, ``A Hyperdoctrinal view of concurrent constraint programming'', Proceedings of the REX Workshop on Semantics: Foundations and Applications, eds. J. W. deBakker, W.-P. de Rover and G. Rozenberg, LNCS 666, pp 457-476, 1993.
  • 58. UWA Computer Science & Software Engineering - Concurrent Programming
    concurrent programming (230.304). The students will gain indepth technical competencein software engineering issues related to concurrent programming.
    http://undergraduate.cs.uwa.edu.au/outlines/230.304.html
    U NIT O UTLINES
      home undergraduate Concurrent Programming Concurrent Programming Homepage
      Concurrent Programming (230.304)
      6 points / Semester 1 Handbook Description

      Investigating techniques for performing computations using more than one processing agent is the prime focus of this unit. The overall objective of concurrent programming is to increase computing efficiency in executing a task by appropriately coordinating the activities of multiple processes, each computing part of the solution to the task. The purpose of this unit is to expose the issues involved in concurrent programming both from practical and theoretical standpoints. After introducing a model used as a basis for analysing concurrency, topics including concurrent algorithms, architectures and programming languages are addressed. A series of tutorials and laboratories based on a concurrent language, give further theoretical and practical exposure to concurrency. Prerequisites Unit Aims
      The need to understand and work with the notion of concurrency is becoming increasingly important as the processing limits of sequential programs on sequential machines begin to be reached. Thus multiprocessor configurations are now commonplace in large-scale computing environments. However, these multiprocessor systems generally run sequential application programs: it is the operating system that embodies principles of concurrency. With the advent of low cost multiprocessor systems (eg Transputer) on the one hand and massively parallel systems (eg Ncube) on the other, the responsibility of extracting maximum utilization of these systems is increasingly falling upon the application developer. The focus of this unit will be the i understanding and designing of concurrent systems. Time permitting, consideration will also be given to massively parallel systems such as artificial neural networks.

    59. CS 598, Concurrent Programming
    CS 598 concurrent programming. Summer 2002. This is a seminar in concurrentprogramming intended for upper-level undergraduate and graduate students.
    http://www.monmouth.edu/rclayton/web-pages/u02-498-598/
    CS 598 - Concurrent Programming
    Summer 2002
    If programmers no longer see the need for interference control then I have apparently wasted my most creative years developing rigorous concepts which have now been compromised or abandoned by programmers. - Per Brinch Hansen, Java's Insecure Parallelism
    SIGPLAN Notices , April 1999
    Table of Contents
  • Links
    Seminar Description
    This is a seminar in concurrent programming intended for upper-level undergraduate and graduate students. The prerequisites for this seminar are upper-level undergraduate or graduate standing and a working knowledge of Java. The seminar covers the concurrency parts of Java; you should already be familiar with Java's sequential parts. There will be programming; you should have a good knowledge of programming, data structures, and algorithms. The seminar is divided into six two-week sections. See the syllabus for details. The seminar meets in Howard Hall 530 on Tuesdays and Thursdays from 10:00 a.m. to 12:15 p.m. There is no meeting on Independence Day, Thursday, 4 July. The last day to withdraw is Wednesday, 24 July.
    Objectives
    This seminar is an introduction to intra-process concurrent programming with an emphasis on concepts and methods. At the end of the seminar you should know
  • 60. ACCU Reviews: Concurrent Programming In Java 2ed
    Book Review concurrent programming in Java 2ed by Doug Lea Highly Recommended.ISBN 0 201 31009 0 Publisher AddisonWesley Pages 411 Price £30.99.
    http://www.accu.org/bookreviews/public/reviews/c/c002180.htm

    Home Page
    Reviews Main
    Book Review Concurrent Programming in Java 2ed by Doug Lea
    Highly Recommended ISBN: Publisher: Addison-Wesley Pages: Price: Categories: java parallel systems Reviewed by Ian Bolland in C Vu 12-4 (Jul 2000) Most treatments of Java multi-threading follow the same lines. They present a small example, often a variant of debit- credit, to show the dangers of letting multiple threads access the same variable at the same time and then go on to recommend synchronised methods as the solution to the problem. Now as far as it goes, this is good advice. However synchronised methods are not always the best solution to concurrency problems. Firstly, synchronisation adds an overhead to method calls and this penalises all clients; even those who do not require thread safety. Secondly, it opens up the possibility of deadlock and a lot of effort may be required to prevent deadlock. Finally, it does not by itself prevent clients from getting erroneous results. For example, consider the following code to process all elements in a Vector vec: If other threads are simultaneously modifying vec , this loop may process elements twice, may skip elements and may throw an

    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 3     41-60 of 95    Back | 1  | 2  | 3  | 4  | 5  | Next 20

    free hit counter