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
••
TL;DR: The VBIC95 bipolar junction transistor (BJT) model was developed as an industry standard replacement for the SPICE Gummel-Poon (SGP) model, to improve deficiencies of the SGP model that have become apparent over time as mentioned in this paper.
Abstract: This paper details the VBIC95 bipolar junction transistor (BJT) model. The model was developed as an industry standard replacement for the SPICE Gummel-Poon (SGP) model, to improve deficiencies of the SGP model that have become apparent over time because of the advances in BJT process technology. VBIC95 is still based on the Gummel-Poon formulation, and thus can degenerate to be similar to the familiar SGP model. However, it includes improved modeling of the Early effect, quasi-saturation, substrate and oxide parasitics, avalanche multiplication, and temperature behavior that can be invoked selectively based on model parameter values.
240 citations
•
30 Jun 2003TL;DR: In this article, the authors propose a power system that detects an amount of power consumed by the at least one computer system, and compares the power consumption to a threshold based on the maximum power output of the power supply.
Abstract: At least one computer system receives power from a power system having a maximum power output based on a nominal power consumption of the at least one computer system. The power system is operable to detect an amount of power consumed by the at least one computer system, and compare the power consumption to a threshold based on the maximum power output of the power supply. The power system is operable to place one or more components of the at least one computer system in a lower-power state to reduce power consumption in response to the amount of power consumed by the at least one computer system exceeding the threshold.
240 citations
•
27 Apr 1998TL;DR: It is shown how QML can be used to capture QoS properties as part of designs, and UML, the de-facto standard object-oriented modeling language, is extended to support the concepts of QML.
Abstract: Traditional object-oriented design methods deal with the functional aspects of systems, but they do not address quality of service (QoS) aspects such as reliability, availability, performance, security, and timing. However, deciding which QoS properties should be provided by individual system components is an important part of the design process. Different decisions are likely to result in different component implementations and system structures. Thus, decisions about component-level QoS should be made at design time, before the implementation is begun. Since these decisions are an important part of the design process, they should be captured as part of the design. We propose a general Quality-of-Service specification language, which we call QML. In this paper we show how QML can be used to capture QoS properties as part of designs. In addition, we extend UML, the de-facto standard object-oriented modeling language, to support the concepts of QML. QML is designed to integrate with object-oriented features, such as interfaces, classes, and inheritance. In particular, it allows specification of QoS properties through refinement of existing QoS specifications. Although we exemplify the use of QML to specify QoS properties within the categories of reliability and performance, QML can be used for specification within any QoS category-QoS categories are user-defined types in QML.
240 citations
••
04 Oct 2010TL;DR: The algorithm, mClock, supports proportional-share fairness subject to minimum reservations and maximum limits on the IO allocations for VMs and indicates that these rich QoS controls are quite effective in isolating VM performance and providing better application latency.
Abstract: Virtualized servers run a diverse set of virtual machines (VMs), ranging from interactive desktops to test and development environments and even batch workloads. Hypervisors are responsible for multiplexing the underlying hardware resources among VMs while providing them the desired degree of isolation using resource management controls. Existing methods provide many knobs for allocating CPU and memory to VMs, but support for control of IO resource allocation has been quite limited. IO resource management in a hypervisor introduces significant new challenges and needs more extensive controls than in commodity operating systems.This paper introduces a novel algorithm for IO resource allocation in a hypervisor. Our algorithm, mClock, supports proportional-share fairness subject to minimum reservations and maximum limits on the IO allocations for VMs. We present the design of mClock and a prototype implementation inside the VMware ESX server hypervisor. Our results indicate that these rich QoS controls are quite effective in isolating VM performance and providing better application latency. We also show an adaptation of mClock (called dmClock) for a distributed storage environment, where storage is jointly provided by multiple nodes.
240 citations
•
04 Apr 1991TL;DR: In this article, a critical path for executing a task such as evaluating a database query is determined, and the minimum time to execute the task assuming infinite resources such as processors and memory buffers is calculated.
Abstract: A method of controlling the allocation of resources in a parallel processor computer. A critical path for executing a task such as evaluating a database query is determined. The minimum time to execute the task assuming infinite resources such as processors and memory buffers is calculated. Resources are scheduled against subtasks so as to execute the task in the calculated minimum time. The number of resources would be required to meet the schedule is determined and if the computer has that many resources the schedule is carried out. Otherwise a revised execution time is calculated, preferably by using as a scaling factor the ratio between the number of required resources and the number of available resources. Then the schedule is adjusted so that the task can be executed in the revised time and the number of resources that would be required to meet the adjusted schedule is determined. If the computer has that many resources the schedule is carried out, otherwise the process is repeated. Preferably the process is halted if two iterations result in the same number of resources being needed.
239 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 |