Bounding node-to-sink latency is an important issue of wireless sensor networks (WSNs) with a quality of service requirement. This paper proposes to deploy multiple sinks to control the worst case node-to-sink data latency in WSNs. The end-to-end latency in multihop wireless networks is known to be proportional to the hop length of the routing path that the message moves over. Therefore, we for...

Network-attached storage devices provide ways to build large scalable file systems that distribute data and load across multiple network nodes. Even though data is distributed, most file systems require a shared server to manage centralized data for clients. This paper investigates ways to use a scheduler to support latency guarantees for requests to a centralized data server. We develop a simp...

Disk arm scheduling algorithms have been studied for many years to increase disk I/O performance. Most of the disks by the early 1980’s are characterized as a linear seek time and their seek time is responsible for the most time of disk access. So, the existing disk scheduling algorithms have focused on the reduction of the average seek distance. Seek time has improved greatly and today’s disks...

PURPOSE The aim of this study was to compare the asymmetrical light reflex of the control subjects and patients with optic nerve disease and to evaluate the relationships among the relative afferent pupillary defect (RAPD), visual acuity (VA), central critical fusion frequency (CFF), ganglion cell complex thickness (GCCT), and circumpapillary retinal nerve fiber layer thickness (cpRNFLT) using ...

OBJECTIVE The present study's aim was to analyze the late responses' parameters in order to determine the utility of each one. METHODS The study, conducted on a total of 325 patients with entrapment neuropathy of the median nerve and 36 with entrapment neuropathy of the ulnar nerve, included the bilateral evaluation of the median and the ulnar nerve and analysis of 20 F-wave and 4 A-wave para...

To improve performance and meet power constraints, vendors are introducing heterogeneous multicores that combine high performance and low power cores. However, choosing which cores and scheduling applications on them remain open problems. This paper presents a scheduling algorithm that provably minimizes energy on heterogeneous multicores and meets latency constraints for interactive applicatio...

Many algorithms have been developed for implementing division in hardware. These algorithms di er in many aspects, including quotient convergence rate, fundamental hardware primitives, and mathematical formulations. This paper presents a taxonomy of division algorithms which classi es the algorithms based upon their hardware implementations and impact on system design. Division algorithms can b...

Excessive end-to-end latency and insufficient update rate continue to be major limitations of virtual environment (VE) system performance. Beginning from a typical baseline VE in which a spatial tracker is polled to deliver data via an RS-232 interface at each update of a single application program, we examined a series of hardware and software reconfigurations with the aim of reducing end-to-e...

We present a methodology to design energy-efficient data paths using FPGAs. Our methodology integrates domain specific modeling, coarse-grained performance evaluation, design space exploration, and low level simulation to understand the tradeoffs between energy, latency, and area. The domain specific modeling technique defines a high-level model by identifying various components and parameters ...