1. DLL - Eric Shull - Effective Communication

    01:14:11

    from Atomic Object Added 108 0 0

    Eric Shull (@exupero) speaks on concurrency in Go and its basis in CSP (communicating sequential processes).

    + More details
    • Finding and Solving Deadlocks in Multi-Threaded Java Code - Part 3 of 3

      55:12

      from Heinz Kabutz Added 467 0 0

      In this workshop by ExitCertified, we looked at how we avoid liveness hazards, how we find them and how we test that they are truly gone. You will learn several new unpublished techniques that will help you become more of a concurrency specialist. Material is from our new Concurrency Specialist Course (http://www.javaspecialists.eu/courses/concurrency.jsp). You are welcome to share this with your friends in industry. This is part 3 of 3. After the lecture was done, we also spent time doing an exercise and we had some interesting questions and discussions by the participants of the workshop. Here is the outline of the workshop: 10 Avoiding Liveness Hazards * 10.1 Deadlock o The drinking philosophers o Causing a deadlock amongst philosophers o Resolving deadlocks o Discovering deadlocks o Lock-ordering deadlocks o Defining a global ordering o Dynamic lock order deadlocks o Defining order on dynamic locks o Checking whether locks are held o Imposing a natural order o Deadlock between cooperating objects o Open calls and alien methods + Example in Vector o Resource deadlocks o Thread-starvation deadlocks * 10.2 Avoiding and diagnosing deadlocks o Avoiding multiple locks o Using open calls o Unit testing for lock ordering deadlocks o Adding a sleep to cause deadlocks o Verifying thread deadlocks o Timed lock attempts o "TryLock" with synchronized o Deadlock analysis with thread dumps o Stopping deadlock victims o DeadlockArbitrator * 10.3 Other liveness hazards o Starvation + ReadWriteLock in Java 5 vs Java 6 + Detecting thread starvation o Poor responsiveness o Livelock

      + More details
      • Finding and Solving Deadlocks in Multi-Threaded Java Code - Part 2 of 3

        33:33

        from Heinz Kabutz Added 253 1 0

        In this workshop by ExitCertified, we looked at how we avoid liveness hazards, how we find them and how we test that they are truly gone. You will learn several new unpublished techniques that will help you become more of a concurrency specialist. Material is from our new Concurrency Specialist Course (http://www.javaspecialists.eu/courses/concurrency.jsp). You are welcome to share this with your friends in industry. This is part 2 of 3. After the lecture was done, we also spent time doing an exercise and we had some interesting questions and discussions by the participants of the workshop. Here is the outline of the workshop: 10 Avoiding Liveness Hazards * 10.1 Deadlock o The drinking philosophers o Causing a deadlock amongst philosophers o Resolving deadlocks o Discovering deadlocks o Lock-ordering deadlocks o Defining a global ordering o Dynamic lock order deadlocks o Defining order on dynamic locks o Checking whether locks are held o Imposing a natural order o Deadlock between cooperating objects o Open calls and alien methods + Example in Vector o Resource deadlocks o Thread-starvation deadlocks * 10.2 Avoiding and diagnosing deadlocks o Avoiding multiple locks o Using open calls o Unit testing for lock ordering deadlocks o Adding a sleep to cause deadlocks o Verifying thread deadlocks o Timed lock attempts o "TryLock" with synchronized o Deadlock analysis with thread dumps o Stopping deadlock victims o DeadlockArbitrator * 10.3 Other liveness hazards o Starvation + ReadWriteLock in Java 5 vs Java 6 + Detecting thread starvation o Poor responsiveness o Livelock

        + More details
        • Finding and Solving Deadlocks in Multi-Threaded Java Code - Part 1 of 3

          56:30

          from Heinz Kabutz Added 741 1 0

          In this workshop by ExitCertified, we looked at how we avoid liveness hazards, how we find them and how we test that they are truly gone. You will learn several new unpublished techniques that will help you become more of a concurrency specialist. Material is from our new Concurrency Specialist Course (http://www.javaspecialists.eu/courses/concurrency.jsp). You are welcome to share this with your friends in industry. This is part 1 of 3. After the lecture was done, we also spent time doing an exercise and we had some interesting questions and discussions by the participants of the workshop. Here is the outline of the workshop: 10 Avoiding Liveness Hazards * 10.1 Deadlock o The drinking philosophers o Causing a deadlock amongst philosophers o Resolving deadlocks o Discovering deadlocks o Lock-ordering deadlocks o Defining a global ordering o Dynamic lock order deadlocks o Defining order on dynamic locks o Checking whether locks are held o Imposing a natural order o Deadlock between cooperating objects o Open calls and alien methods + Example in Vector o Resource deadlocks o Thread-starvation deadlocks * 10.2 Avoiding and diagnosing deadlocks o Avoiding multiple locks o Using open calls o Unit testing for lock ordering deadlocks o Adding a sleep to cause deadlocks o Verifying thread deadlocks o Timed lock attempts o "TryLock" with synchronized o Deadlock analysis with thread dumps o Stopping deadlock victims o DeadlockArbitrator * 10.3 Other liveness hazards o Starvation + ReadWriteLock in Java 5 vs Java 6 + Detecting thread starvation o Poor responsiveness o Livelock

          + More details
          • State, You're Doing It Wrong: Exploring Alternative Concurrency Paradigms on the JVM

            49:50

            from JavaZone Added 150 1 0

            Date: 10 Sep 2009 Speaker: Jonas Bonér Location: Oslo, Norway

            + More details
            • GSP Demo: Euler Segment

              01:00

              from vasicek Added 132 0 0

              + More details
              • GSP Demo: Medians and Centroid

                00:49

                from vasicek Added 20 0 0

                + More details
                • GSP Demo: Angle Bisectors and Incenter

                  00:53

                  from vasicek Added 42 0 0

                  + More details
                  • LKRhash: The design of a scalable hashtable — George V. Reilly

                    01:00:18

                    from NWCPP: Northwest C++ Users Group Added 111 1 0

                    Slides, etc: http://nwcpp.org/june-2012.html Abstract LKRhash is a hashtable that scales to multiple processors and millions of items. LKRhash was invented at Microsoft in 1997 by Paul Larson, Murali Krishnan, and George Reilly, and has been used in many Microsoft products. George will discuss the techniques that give LKRhash its performance, including linear hashing, cache-friendly data structures, and fine-grained locking. Speaker Bio George Reilly is a lead developer at Cozi who spent 10 years working at Microsoft. He is a graduate of Trinity College Dublin and Brown University. He cowrote Beginning ATL 3 COM Programming (Wrox 1999) and Professional Active Server Pages 3.0 (Wrox 1999). George is, among other things, a cyclist; the President of Freely Speaking Toastmasters; the Director & Dramaturg of the Wild Geese Players of Seattle; and the Secretary/Webmaster of NWCPP.

                    + More details

                    What are Tags?

                    Tags

                    Tags are keywords that describe videos. For example, a video of your Hawaiian vacation might be tagged with "Hawaii," "beach," "surfing," and "sunburn."