Institution
Hewlett-Packard
Company•Palo Alto, California, United States•
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.
Papers published on a yearly basis
Papers
More filters
•
24 Jun 1991TL;DR: In this article, a power supply for a computer system manager is described, where the power supply has its own secondary power source operable when input power to the system manager no longer meets preset threshold values.
Abstract: A power supply for a computer system manager, wherein the power supply has its own secondary power source operable when input power to the system manager no longer meets preset threshold values. The power supply functions in one of a discrete number of power modes depending upon the amount of energy available from either the computer input power or the secondary power source. The power supply switches to one of the group of power modes to conserve secondary power when the computer input power is no longer available. The power modes are controlled by a power mode controller which selectively directs power to discrete components of the system manager as a power conservation technique. The power mode controller always energizes the random access memory of the system manager in order to maintain data integrity. Upon detecting insufficient energy within the secondary power source, the power mode controller terminates all power flow from the power supply, including power flow to the random access memory, at which point the entire system has lost all data and configuration settings.
188 citations
•
02 Jul 2001TL;DR: In this article, a broadband network node for a best effort network such as the Internet or intranets which supports the inexpensive and rapid deployment of services to the best efforts network is provided, where a series of processing blades perform a modification function for each blade that processes packets according to classifications.
Abstract: A system and method provides a broadband network node for a best effort network such as the Internet or intranets which supports the inexpensive and rapid deployment of services to the best efforts network. Separate data path and control path mechanisms allow high-speed data transfers with parallel processing flows for the data path that are controlled across data flows by the control path. Packets are classified, modified and shaped to enable the service on the network with an accountant to track packet traffic for control and billing purposes. A series of processing blades perform a modification function for each blade that processes packets according to classifications. The processing blades are modular and scalable for insertion in the broad band switch to rapidly adapt the broadband network node for new services.
187 citations
•
02 Mar 2005TL;DR: In this article, a cable assembly having a connector for coupling to at least one of a stylus and a display assembly is described, with the cable having at least a conductor for providing charging power to a rechargeable power supply of the stylus.
Abstract: Disclosed is a cable assembly having a connector for coupling to at least one of a stylus and a display assembly, the cable assembly having at least one conductor for providing charging power to a rechargeable power supply of the stylus from a power supply of the display assembly
187 citations
••
14 Nov 2011TL;DR: This paper proposes a set of desirable properties for allocating the network bandwidth in a datacenter at the VM granularity, and shows that there exists a fundamental tradeoff between the ability to share congested links in proportion to payment and the able to provide minimal bandwidth guarantees to VMs.
Abstract: The network is a crucial resource in cloud computing, but in contrast to other resources such as CPU or memory, the network is currently shared in a best effort manner. However, sharing the network in a datacenter is more challenging than sharing the other resources. The key difficulty is that the network allocation for a VM X depends not only on the VMs running on the same machine with X, but also on the other VMs that X communicates with, as well as on the cross-traffic on each link used by X. In this paper, we first propose a set of desirable properties for allocating the network bandwidth in a datacenter at the VM granularity, and show that there exists a fundamental tradeoff between the ability to share congested links in proportion to payment and the ability to provide minimal bandwidth guarantees to VMs. Second, we show that the existing allocation models violate one or more of these properties, and propose a mechanism that can select different points in the aforementioned tradeoff between payment proportionality and bandwidth guarantees.
187 citations
••
21 Mar 2007TL;DR: This paper demonstrates that transaction mix nonstationarity enables a new approach to predicting application- level performance as a function of transaction mix, and allows application-level performance to guide consolidation decisions.
Abstract: Real production applications ranging from enterprise applications to large e-commerce sites share a crucial but seldom-noted characteristic: The relative frequencies of transaction types in their workloads are nonstationary, i.e., the transaction mix changes over time. Accurately predicting application-level performance in business-critical production applications is an increasingly important problem. However, transaction mix nonstationarity casts doubt on the practical usefulness of prediction methods that ignore this phenomenon.This paper demonstrates that transaction mix nonstationarity enables a new approach to predicting application-level performance as a function of transaction mix. We exploit nonstationarity to circumvent the need for invasive instrumentation and controlled benchmarking during model calibration; our approach relies solely on lightweight passive measurements that are routinely collected in today's production environments. We evaluate predictive accuracy on two real business-critical production applications. The accuracy of our response time predictions ranges from 10% to 16% on these applications, and our models generalize well to workloads very different from those used for calibration.We apply our technique to the challenging problem of predicting the impact of application consolidation on transaction response times. We calibrate models of two testbed applications running on dedicated machines, then use the models to predict their performance when they run together on a shared machine and serve very different workloads. Our predictions are accurate to within 4% to 14%. Existing approaches to consolidation decision support predict post-consolidation resource utilizations. Our method allows application-level performance to guide consolidation decisions.
187 citations
Authors
Showing all 34676 results
Name | H-index | Papers | Citations |
---|---|---|---|
Andrew White | 149 | 1494 | 113874 |
Stephen R. Forrest | 148 | 1041 | 111816 |
Rafi Ahmed | 146 | 633 | 93190 |
Leonidas J. Guibas | 124 | 691 | 79200 |
Chenming Hu | 119 | 1296 | 57264 |
Robert E. Tarjan | 114 | 400 | 67305 |
Hong-Jiang Zhang | 112 | 461 | 49068 |
Ching-Ping Wong | 106 | 1128 | 42835 |
Guillermo Sapiro | 104 | 667 | 70128 |
James R. Heath | 103 | 425 | 58548 |
Arun Majumdar | 102 | 459 | 52464 |
Luca Benini | 101 | 1453 | 47862 |
R. Stanley Williams | 100 | 605 | 46448 |
David M. Blei | 98 | 378 | 111547 |
Wei-Ying Ma | 97 | 464 | 40914 |