Hewlett-Packard

About: Hewlett-Packard is a company organization based out in Palo Alto, California, United States. It is known for research contribution in the topics: Signal & Substrate (printing). The organization has 34663 authors who have published 59808 publications receiving 1467218 citations. The organization is also known as: Hewlett Packard & Hewlett-Packard Company.

Scalable, efficient range queries for grid information services

Abstract: Recent peer-to-peer (P2P) systems such as Tapestry, Chord or CAN act primarily as a distributed hash table (DHT). A DHT is a data structure for distributed storing of pairs (key, data) which allows fast locating of data when a key is given. To facilitate efficient queries on a range of keys, we propose a CAN-based extension of this DHT-functionality. The design of our extension suggests several range query strategies; their efficiency is investigated in the paper. A further goal is to enhance the routing aspects of current DHT-systems so that frequently changing data can also be handled efficiently. We show that relatively simple approaches are able to reduce the communication overhead in this case. The design of the system is driven by its application as a part of the information infrastructure for computational grids. Such grids provide an infrastructure for sharing computing resources; an information infrastructure is their inherent part which collects resource data and provides search functionality. Our approach complements current solutions such as MDS-2 by adding self-organization, fault-tolerance and an ability to efficiently handle dynamic attributes, such as server processing capacity. We evaluate our system in this context via a simulation and show that its design along with particular query and update strategies meet the goals of scalability, communication-efficiency and availability.

Algebraic-geometry codes

Abstract: The theory of error-correcting codes derived from curves in an algebraic geometry was initiated by the work of Goppa as generalizations of Bose-Chaudhuri-Hocquenghem (BCH), Reed-Solomon (RS), and Goppa codes. The development of the theory has received intense consideration since that time and the purpose of the paper is to review this work. Elements of the theory of algebraic curves, at a level sufficient to understand the code constructions and decoding algorithms, are introduced. Code constructions from particular classes of curves, including the Klein quartic, elliptic, and hyperelliptic curves, and Hermitian curves, are presented. Decoding algorithms for these classes of codes, and others, are considered. The construction of classes of asymptotically good codes using modular curves is also discussed.

Sub-100 fJ and sub-nanosecond thermally driven threshold switching in niobium oxide crosspoint nanodevices.

Abstract: We built and measured the dynamical current versus time behavior of nanoscale niobium oxide crosspoint devices which exhibited threshold switching (current-controlled negative differential resistance) The switching speeds of 110 × 110 nm(2) devices were found to be Δt(ON) = 700 ps and Δt(OFF) = 2:3 ns while the switching energies were of the order of 100 fJ We derived a new dynamical model based on the Joule heating rate of a thermally driven insulator-to-metal phase transition that accurately reproduced the experimental results, and employed the model to estimate the switching time and energy scaling behavior of such devices down to the 10 nm scale These results indicate that threshold switches could be of practical interest in hybrid CMOS nanoelectronic circuits

Flexible scheme for admission control of multimedia streams on integrated networks

Abstract: An admission control scheme for real-time traffic requests in communication networks is disclosed. The scheme monitors tile performance of each link and predicts the traffic guarantees that can be offered when certain dummy traffic (pseudo traffic) mimicking the behavior of real-time streams is added to the existing traffic. When an application requests connection to the network, it specifies a Quality of Service (QoS) bound that it desires. A routing subsystem of tile network makes use of the predicted values while attempting to find a path over which tile application's QoS bound requirement will be satisfied. After the route is chosen, connection setup will involve verifying at each node along the route whether sufficient resources exist to support tile new connection. This explicit verification is likely to be necessary because the routing subsystem does not normally have up-to-date global state information. After admitting tile application, the network provides a soft guarantee that the QoS bound provided to it will be adhered to for most of the time. On the other hand, if no path through the network satisfies the QoS hound, tile application is denied connection to the network.