Short-circuit evaluation

Short-circuit evaluation, minimal evaluation, or McCarthy evaluation (after John McCarthy) is the semantics of some Boolean operators in some programming languages in which the second argument is executed or evaluated only if the first argument does not suffice to determine the value of the expression: when the first argument of the AND function evaluates to false, the overall value must be false; and when the first argument of the OR function evaluates to true, the overall value must be true. In programming languages with lazy evaluation (Lisp, Perl, Haskell), the usual Boolean operators short-circuit. In others (Ada, Java, Delphi), both short-circuit and standard Boolean operators are available. For some Boolean operations, like exclusive or (XOR), it is not possible to short-circuit, because both operands are always required to determine the result. Short-circuit operators are, in effect, control structures rather than simple arithmetic operators, as they are not strict. In imper

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (11)

Related publications

Related people

Related units

Related concepts (17)

Exclusive or or exclusive disjunction or exclusive alternation, also known as non-equivalence which is the negation of equivalence, is a logical operation that is true if and only if its arguments di

Lisp (historically LISP, an acronym for list processing) is a family of programming languages with a long history and a distinctive, fully parenthesized prefix notation. Originally specified in 1960,

In computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program. Common requirements are to minimize a program's execution tim

Related concepts

Related courses (14)

Related courses

Related lectures (24)

Related lectures

Decoding of error-related potentials in continuous feedback protocols for personalized human computer interaction

Fumiaki Iwane

The ability to notice erroneous behavior is crucial for effective training. Within the framework of neuroprosthetics, numerous studies in electroencephalography (EEG) confirm the existence of neural correlates when humans perceive the erroneous actions of the device. Subsequently, the decoding of this correlate has been used to correct the erroneous behavior performed by the agent or to tune the behavioral strategy of the agent, among others. However, a main limitation of current approaches is that the actions of the agent were discretized, thus restraining the usability of such systems. The main objective of this PhD study is to study, and decode, the neural correlates of error evaluation under continuous trajectories performed by external agents; and to use this decoding to tune the continuous behavior of the agent for individual users. To accomplish this goal, two essential questions will be investigated: (i) whether it is possible to infer individual preference under continuous state-action scenarios, and (ii) how to create a reliable decoding pipeline in a continuous fashion. Results obtained during the first year of the PhD have confirmed the existence of such correlates under continuous motions of a robotic arm. Furthermore, such correlates encode individual preferences, indicating that the neural prosthesis can be also customized for individual users, which may play an important rule to increase the quality of brain-computer based assistance. This property not only will increase the level of perceived assistance provided by a brain-computer interface, but also may facilitate embodiment of the brain-controlled device.

EPFL2021

Optimus Prime: Accelerating Data Transformation in Servers

Mario Paulo Drumond Lages De Oliveira, Babak Falsafi, Siddharth Gupta, Hussein Kassir, Christoph Koch, Arash Pourhabibi Zarandi, Mark Johnathon Sutherland, Zilu Tian

Modern online services are shifting away from monolithic applications to loosely-coupled microservices because of their improved scalability, reliability, programmability and development velocity. Microservices communicating over the datacenter network require data transformation (DT) to convert messages back and forth between their internal formats. This work identifies DT as a bottleneck due to reductions in latency of the surrounding system components, namely application runtimes, protocol stacks, and network hardware. We therefore propose Optimus Prime (OP), a programmable DT accelerator that uses a novel abstraction, an in-memory schema, to represent DT operations. The schema is compatible with today's DT frameworks and enables any compliant accelerator to perform the transformations comprising a request in parallel. Our evaluation shows that OP's DT throughput matches the line rate of today's NICs and has 60x higher throughput compared to software, at a tiny fraction of the CPU's silicon area and power. We also evaluate a set of microservices running on Thrift, and show up to 30% reduction in service latency.

ACM2020

Microsecond Consensus for Microsecond Applications

Naama Ben David, Rachid Guerraoui, Athanasios Xygkis, Mihail Igor Zablotchi

We consider the problem of making apps fault-tolerant through replication, when apps operate at the microsecond scale, as in finance, embedded computing, and microservices apps. These apps need a replication scheme that also operates at the microsecond scale, otherwise replication becomes a burden. We propose Mu, a system that takes less than 1.3 microseconds to replicate a (small) request in memory, and less than a millisecond to fail-over the system-this cuts the replication and fail-over latencies of the prior systems by at least 61% and 90%. Mu implements bona fide state machine replication/consensus (SMR) with strong consistency for a generic app, but it really shines on microsecond apps, where even the smallest overhead is significant. To provide this performance, Mu introduces a new SMR protocol that carefully leverages RDMA. Roughly, in Mu a leader replicates a request by simply writing it directly to the log of other replicas using RDMA, without any additional communication. Doing so, however, introduces the challenge of handling concurrent leaders, changing leaders, garbage collecting the logs, and more-challenges that we address in this paper through a judicious combination of RDMA permissions and distributed algorithmic design. We implemented Mu and used it to replicate several systems: a financial exchange app called Liquibook, Redis, Memcached, and HERD [33]. Our evaluation shows that Mu incurs a small replication latency, in some cases being the only viable replication system that incurs an acceptable overhead.

USENIX ASSOC2020

MICRO-211: Analog circuits and systems

This course introduces the analysis and design of linear analog circuits based on operational amplifiers. A Laplace early approach is chosen to treat important concepts such as time and frequency responses, convolution, and filter design. The course is complemented with exercises and simulations.

ME-446: Two-phase flows and heat transfer

This course covers the theoretical and practical analysis of two-phase flow and applications. Fundamental two-phase heat transfer in the form of condensation and boiling are studied in detail. Advanced topics such as microchannel two-phase flow, microfinned tubes and oil effects are also handled.

MICRO-470: Scaling laws & simulations in micro & nanosystems

This class combines an analytical and finite elements modeling (FEM) simulations approach to scaling laws in MEMS/NEMS. The dominant physical effects and scaling effects when downsizing sensors and actuators in microsystems are discussed, across a broad range of actuation principles.

Exclusive or or exclusive disjunction or exclusive alternation, also known as non-equivalence which is the negation of equivalence, is a logical operation that is true if and only if its arguments di

Lisp (historically LISP, an acronym for list processing) is a family of programming languages with a long history and a distinctive, fully parenthesized prefix notation. Originally specified in 1960,

In computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program. Common requirements are to minimize a program's execution tim