This paper presents a clock selection algorithm for control-flow intensive behaviors that are characterized by the presence of conditionals and deeply-nested loops. Unlike previous works, which are primarily geared towards data-dominated behaviors, this algorithm examines the effects of branch probabilities and their interaction with allocation constraints. We demonstrate, using examples, how c...

The Intel Cluster OpenMP (CLOMP) compiler and associated runtime environment offer the potential to run OpenMP applications over a few nodes of a cluster. This paper reports on our efforts to use CLOMP with the Gaussian quantum chemistry code. Sample results on a four node quad core Intel cluster show reasonable speedups. In some cases it is found preferable to use multiple nodes compared to us...

In this work complexity is defined as the combination of the number and types of Value Transfer Functions (VTF) between stakeholders of a system. Increasing the number of stakeholders increases the complexity. The two primary objectives of management of the complexity are to (i) reduce the uncertainty of estimating project schedule and budget, and (ii) improve the performance of the team. Manag...

This paper presents a novel hardware-based approach for identifying, prooling, and monitoring hot spots in order to support runtime optimization of general-purpose programs. The proposed approach consists of a set of tightly coupled hardware tables and control logic modules that are placed in the retirement stage of a processor pipeline removed from the critical path. The features of the propos...

In a traditional multi-camera surveillance system, it’s hard to find the routes of the suspect objects, and search for those video clips related to the suspect objects from the surveillance database. In this paper, we present a framework for spatial relationship construction, abnormal event detection and video content searching for visual surveillance applications. This system can automatically...

This paper presents a low-cost and highperformance programmable digital finite impulse response (FIR) filter. The architecture employs the computation sharing algorithm to reduce the computation complexity. In the traditional computation sharing algorithm, critical path constraint on the output summation stage is a bottleneck, thus, the canonic-sign-digit representation is utilized for filter c...

Device scaling and large integration increase the vulnerability of microprocessors to transient errors. One of the structures where errors can be most harmful is the register file, because it is part of the architectural state. Moreover, because the register file is frequently read, an error can quickly propagate to other parts of the processor. This paper presents Shield, a novel, cost-effecti...

Previous research has introduced novel energy saving techniques such as the use of multiple VDD and VTH transistors, as well as transistor sizing, to limit storage energy and standby power. These techniques have been used to lower the power consumed in the non-critical paths of a design for a given performance specified by the critical path. In this report, a proposal to investigate how dual-su...

This paper presents a novel layout model and floorplanning tool particularly suitable for taking into account user defined layout constraints on specific sets of modules and specific locations. The user defined layout constraints can be the setting of any common topological property associated with a group of specific modules such as the neighboring property for example. Or the use of any topol...

The maximum mean weight cycle problem is well-known: given a digraph G with weights 9 c :E(G) → R, 3nd a directed circuit in G whose mean weight is maximum. Closely related is the minimum balance problem: Find a potential :V (G) → R such that the numbers 11 slack(e):= (w)− (v)− c((v; w)) (e= (v; w)∈E(G)) are optimally balanced: for any subset of vertices, the minimum slack on an entering edge s...