No abstract

No abstract

No abstract

In the nanoscale regime, the behavior of both extant and emerging semiconductor devices are often unreliable. Reliability of such devices often trades-off with their energy consumption, speed, and/or chip area. We study the energy-reliability limits for circuits designed using such devices. Using the mutual information propagation in logic circuits technique developed by Pippenger, together with optimization, we obtain lower bounds on the energy consumption for computing n-input boolean functions. Most extant technologies require all gates to have the same electrical operating point and in circuits of such uniform gates, the minimum energy required to achieve any nontrivial reliability scales superlinearly with the number of inputs. On the other hand, in some emerging technologies such as spin electronics, where the gates in a circuit can have different operating points, energy scaling can be linear in the number of inputs. As part of our development we find a simple procedure for energy allocation across gates in a boolean circuit with different operating points.

We study the information-theoretic limit of reliable information processing by a server with queue-length dependent quality of service. We define the capacity for such a system as the number of bits reliably processed per unit time, and characterize it in terms of queuing system parameters. We also characterize the distributions of the arrival and service processes that maximize and minimize the capacity of such systems in a discrete-time setting. For arrival processes with at most one arrival per time slot, we observed a minimum around the memoryless distribution. We also studied the case of multiple arrivals per time slot, and observed that burstiness in arrival has adverse effects on the system. The problem is theoretically motivated by an effort to incorporate the notion of reliability in queueing systems, and is applicable in the contexts of crowdsourcing, multimedia communication, and stream computing. Index Termschannel capacity, quality of service, queuing