Data Races vs. Data Race Bugs: Telling the Difference with Portend

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

In a non-uniform memory access machine, the placement of software threads to hardware cores can have a significant effect on the performance of concurrent applications. Detecting the best possible placement for each application is a necessity for thread sc ...

In a drive to maximize resource utilization, today's datacenters are moving to colocation of latency-sensitive and batch workloads on the same server. State-of-the-art deployments, such as those at Google, colocate such diverse workloads even on a single S ...

We present a lightweight library for testing concurrent Scala programs by systematically exploring multiple interleavings between user-specified operations on shared objects. Our library is targeted at beginners of concurrent programming in Scala, runs on ...

Data races are one of the main causes of concurrency problems in multithreaded programs. Whether all data races are bad, or some are harmful and others are harmless, is still the subject of vigorous scientific debate [Narayanasamy et al. 2007; Boehm 2012]. ...

Concurrency bugs are at the heart of some of the worst bugs that plague software. Concurrency bugs slow down software development because it can take weeks or even months before developers can identify and fix them. In-production detection, root cause ...

As the level of parallelism in manycore processors keeps increasing, providing efficient mechanisms for thread synchronization in concurrent programs is becoming a major concern. On cache-coherent shared-memory processors, synchronization efficiency is ult ...

Debugging real systems is hard, requires deep knowledge of the target code, and is time-consuming. Bug reports rarely provide sufficient information for debugging, thus forcing developers to turn into detectives searching for an explanation of how the prog ...

We report the design and testing of TapaCarp, a CSCL environment for carpenter apprentices. From the start, we designed TapaCarp for a classroom usage. This led to an interface distributed over several components and modalities. A first user study conducte ...

Deadlock immunity is a property by which programs, once afflicted by a deadlock, develop resistance against future occurrences of that deadlock. We enable real applications to automatically achieve immunity against deadlock bugs involving mutex locks, sema ...

Debugging real systems is hard, requires deep knowledge of the code, and is time-consuming. Bug reports rarely provide sufficient information, thus forcing developers to turn into detectives searching for an explanation of how the program could have arrive ...

There is an impedance mismatch between message-passing concurrency and virtual machines, such as the JVM. VMs usually map their threads to heavyweight OS processes. Without a lightweight process abstraction, users are often forced to write parts of concurr ...

A brain-computer interface (BCI) is a communication system that translates brain-activity into commands for a computer or other devices. In other words, a BCI allows users to act on their environment by using only brain-activity, without using peripheral n ...

Biometric identity verification systems frequently face the challenges of non-controlled conditions of data acquisition. Under such conditions biometric signals may suffer from quality degradation due to extraneous, identity-independent factors. It has bee ...

In chip multiprocessors (CMPs), limiting the number of offchip cache misses is crucial for good performance. Many multithreaded programs provide opportunities for constructive cache sharing, in which concurrently scheduled threads share a largely overlappi ...

Data Races vs. Data Race Bugs: Telling the Difference with Portend

Chattez avec Graph Search

Thread-Placement Learning

Stretch: Balancing QoS and Throughput for Colocated Server Workloads on SMT Cores

A Scala Library for Testing Student Assignments on Concurrent Programming

Automated Classification of Data Races Under Both Strong and Weak Memory Models

Techniques for Detection, Root Cause Diagnosis, and Classification of In-Production Concurrency Bugs

Leveraging Hardware Message Passing for Efficient Thread Synchronization

Leveraging Hardware Message Passing for Efficient Thread Synchronization

Execution Synthesis: A Technique for Automating the Debugging of Software

The Benefits and Limitations of Distributing a Tangible Interface in a Classroom

Deadlock Immunity : Enabling General-Purpose Software to Defend Itself against Deadlocks

Execution Synthesis: A Technique for Automated Software Debugging

Scala actors: Unifying thread-based and event-based programming

An efficient P300-based brain-computer interface for disabled subjects

Classification with class-independent quality information for biometric verification

Scheduling threads for constructive cache sharing on CMPs

Actors that Unify Threads and Events