Revision and update operators add new information to some old information represented by a logical theory. Katsuno and Mendelzon show that both revision and update operators can be characterized as accomplishing a minimal change in the old information to accommodate the new information. Arbitration operators add two or more weighted informations together where the weights indicate the relative ...

I have developed a lightweight Deficit Round Robin scheduler for the input arbiter of the NetFPGA router. The design is effective in reducing latency for small packets from one port in the presence of saturating traffic of large packets from another port. The design hides arbitration latency when multiple channels are active and achieves nearly optimal latency for the NetFPGA architecture. The ...

Transactional memory systems trade ease of programming with runtime performance losses in handling transactions. This paper focuses on starvation effects that show up in systems where unordered transactions are committed on a demand-driven basis. Such simple commit arbitration policies are prone to starvation. The design issues for commit arbitration policies are analyzed and novel policies tha...

Assistive Teleoperation as Policy Blending In assistive teleoperation, the robot attempts to predict the user’s intent and augments his or her input based on this prediction, in order to simplify the task. Our recent work on policy blending (Dragan and Srinivasa 2012) formalizes assistance as an arbitration of the user’s input and the robot’s prediction. At any instant, the robot combines the i...

N are often conducted under the stipulation that an impasse is to be resolved using final-offer arbitration (FOA). In fact, FOA frequently is not needed; in Major League Baseball, for instance, more than 80% of the salary negotiations that could go to arbitration instead reach a bargained agreement. We show that the risk aversion of at least one side explains this phenomenon. We then model pay ...

We present a tool suite for working with hierarchical bus schedule/arbitration descriptions for nodes sharing a bus in real-time applications. These schedules can be based on a variety of factors including time slicing and the characteristics of messages. These schedules are represented in a tree-like structure. Using this structure we can describe many popular arbitration schemes, and automati...

This paper presents a scalable and partitionable asynchronous bus arbiter for use with chip multiprocessors (CMP) and its corresponding pre-layout simulation results using VHDL. The arbiter exploits the advantage of a concurrency control instruction (Brk) provided by the micro-threaded microprocessor model to set the priority processor and move the circulated arbitration token at the most likel...

This report deals with the time and energy analysis for RFID arbitration protocols. The goal is to analyse and compare various RFID arbitration algorithms. Two protocols are detailed in here – The tree search algorithm of Capetanakis and a non-monotonic windowing protocol. A new simpler proof is given for the expected time complexity of the tree splitting protocol and the worst case energy cons...

Several theories suggest that pay raises below a reference point will reduce job performance. Final offer arbitration for police unions provides a unique opportunity to examine these theories, as the police officers either receive their requested wage or receive a lower one. In the months after New Jersey police officers lose in arbitration, arrest rates and average sentence length decline, and...

Combinatorial characterization of optimal authentication codes with arbitration was previously given by several groups of researchers in terms of affine a-resolvable $+$ BIBDs and $\alpha$-resolvable designs with some special properties, respectively. In this paper, we revisit this known characterization and restate it using a new idea of GOB designs. This newly introduced combinatorial structu...