Operating systems for sensor networks must provide energy and memory-space efficient execution environments for applications because of the resource constraints of the sensor nodes. The shared-stack cooperative threads have been proposed to conserve stack memory-space and to minimize the possibility of stack overflow in the sensor operating systems. However, stack switching brings about externa...

Today, many general-purpose register-file (GPRF) architectures implement instructionlevel-parallelism (ILP) techniques to improve performance. Less has been done in this area for the so-called ‘stack architecture’. Nonetheless, stack architectures have many advantages over GPRF architectures. Applying ILP techniques in the stack processor domain might ultimately achieve similar, or better, perf...

The Intel® ItaniumTM architecture provides a virtual register stack of unlimited size for use by software. New virtual registers are allocated on a procedure call and deallocated on return. Itanium processors implement the register stack by means of a large physical register file, a mapping from virtual to physical registers, and a Register Stack Engine (RSE) that saves and restores the content...

Leakage power consumption of current CMOS technology is already a great challenge. ITRS projects that leakage power consumption may come to dominate total chip power consumption as the technology feature size shrinks. We propose a novel leakage reduction technique, named “sleepy stack,” which can be applied to general logic design. Our sleepy stack approach retains exact logic state – making it...

More than a few failures of Transportation System Networks are caused by kernel stack overflow. Transportation System Networks use operating systems like Android that employs the Linux kernel which has a fixed size kernel stack. Unfortunately, nowadays there is no mechanism to avert the kernel from overflowing the stack. With the purpose of putting a stop to this fault, we present a dynamically...

We consider the stack of coherent algebras with proper support, a moduli problem generalizing Alexeev and Knutson's stack of branchvarieties to the case of an Artin stack. The main results are proofs of the existence of Quot and Hom spaces in greater generality than is currently known and several applications to Alexeev and Knutson's original construction: a proof that the stack of branchvariet...

The four different types of stack filters, type-0 through type-3, are determined by four different shapes of the on-set of the positive Boolean function from which the stack filter is constructed. Under all three appending strategies commonly considered in the literature---first and last value carry-on strategy, constant value carry-on strategy, and the circular approach--stack filters of type-...