3 resultados para Clocks and watches.

em QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast


Relevância:

30.00% 30.00%

Publicador:

Resumo:

Modern ‘nonscripted’ theatre (NST) clearly owes much to improvisation. Perhaps less obviously, and more surprisingly, so too does modern law. In this article I will contend that, despite all the rules of evidence and procedure, statutes and legal precedents that fundamentally govern the decisions and actions of a judge, it is only through ‘spontaneity’ that judgment can take place. This claim may appear strange to those well-versed in the common law tradition which proceeds on the basis of past legal decisions, or reason where no precedent exists. NST, on the other hand, is assumed to rely heavily on the unprecedented and unreasoned. Therefore, when the public watches a NST production, it places its faith in the belief that what is being observed is entirely new and is being produced ‘on the spur of the moment’.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

We propose a dynamic verification approach for large-scale message passing programs to locate correctness bugs caused by unforeseen nondeterministic interactions. This approach hinges on an efficient protocol to track the causality between nondeterministic message receive operations and potentially matching send operations. We show that causality tracking protocols that rely solely on logical clocks fail to capture all nuances of MPI program behavior, including the variety of ways in which nonblocking calls can complete. Our approach is hinged on formally defining the matches-before relation underlying the MPI standard, and devising lazy update logical clock based algorithms that can correctly discover all potential outcomes of nondeterministic receives in practice. can achieve the same coverage as a vector clock based algorithm while maintaining good scalability. LLCP allows us to analyze realistic MPI programs involving a thousand MPI processes, incurring only modest overheads in terms of communication bandwidth, latency, and memory consumption. © 2011 IEEE.