Go is a production-level statically typed programming languagewhose design features explicit message-passing primitives andlightweight threads, enabling (and encouraging) programmers todevelop concurrent systems where components interact throughcommunication more so than by lock-based shared memory con-currency. Go can only detect global deadlocks at runtime, but pro-vid...

This paper presents a new static type system for multithreaded programs; well-typed programs in our system are guaranteed to be free of data races and deadlocks. Our type system allows programmers to partition the locks into a fixed number of equivalence classes and specify a partial order among the equivalence classes. The type checker then statically verifies that whenever a thread holds more...

This paper explores the suitability of the Chandy-Misra algorithm for digital logic simulation. We use four realistic circuits as benchmarks for our analysis, including the vector-unit controller for the Titan supercomputer from Ardent. Our results show that the average number of logic elements available for concurrent execution ranges from 10 to 111 for the four circuits, with an overall avera...

The advent of multicore processors has made concurrent programming models mandatory. However, most concurrent programming models come with a repertoire of problems. The two major ones are non-determinism and deadlocks. By determinism, we mean the output behavior of the program is independent of the interleaving caused by the schedule and depends only on the input behavior. A few concurrent mode...

We show that deadlocks due to dependencies on consumption channels is a fundamental problem in mul ticast wormhole routing This issue of deadlocks has not been addressed in many previously proposed multicast algo rithms We also show that deadlocks on consumption chan nels can be avoided by using multiple classes of consump tion channels and restricting the use of consumption chan nels by multic...

In interconnection networks, there are several problems related to deadlock. We shall address deadlocks in the context of modularity, shortest path routing in irregular networks and fault tolerance. Deadlock freedom in interconnection networks is not a modular issue. One cannot generally combine two or more deadlock free interconnection network configurations without introducing new deadlock pr...

Before reaching full autonomy, vehicles will gradually be equipped with more and more advanced driver assistance systems (ADAS), effectively rendering them semi-autonomous. However, current ADAS technologies seem unable to handle complex traffic situations, notably when dealing with vehicles arriving from the sides, either at intersections or when merging on highways. The high rate of accidents...

Multicast operation is an important operation in multicomputer communication systems and can be used to support several collective communication operations. A signiicant performance improvement can be achieved by supporting multicast operations at the hardware level. In this paper, we propose an asynchronous tree-based multicasting (ATBM) technique for multistage interconnec-tion networks (MINs...

Reasoning about multithreaded object-oriented programs is difficult, due to the non-local nature of object aliasing, data races, and deadlocks. We propose a programming model that prevents data races and deadlocks, and supports local reasoning in the presence of object aliasing and concurrency. Our programming model builds on the multithreading and synchronization primitives as they are present...