<--- Back to Details
First PageDocument Content
HP-UX / Itanium / 64-bit / HP / PA-RISC / Binary code compatibility / Backward compatibility / Linux / GNU Debugger / Computer architecture / Computing / Instruction set architectures
Date: 2005-05-03 17:26:12
HP-UX
Itanium
64-bit
HP
PA-RISC
Binary code compatibility
Backward compatibility
Linux
GNU Debugger
Computer architecture
Computing
Instruction set architectures

Add to Reading List

Source URL: h21007.www2.hp.com

Download Document from Source Website

File Size: 78,54 KB

Share Document on Facebook

Similar Documents

Microsoft Word - 201810_償還価額のお知らせ(HP)

DocID: 1xVY4 - View Document

Theoretical computer science / Logic / Formal methods / Mathematical logic / Model theory / Interpretation / Logic in computer science / Propositional calculus / Boolean satisfiability problem / Automated theorem proving / Propositional variable / IP

Theorem Proving using Lazy Proof Expli ation Corma Flanagan1 , Rajeev Joshi1 , Xinming Ou2 , and James B. Saxe1 1 Systems Resear h Center, HP Labs, Palo Alto, CA 2

DocID: 1xVDI - View Document

Concurrent computing / Computing / Distributed computing / Computers and the environment / Electric power / Energy conservation / Performance per watt / Cluster computing / Parallel computing / Benchmark / Supercomputer / Data center

JouleSort: A Balanced Energy-Efficiency Benchmark Suzanne Rivoire (Stanford), Mehul Shah (HP Labs), Partha Ranganathan (HP Labs), Christos Kozyrakis (Stanford)

DocID: 1xVAA - View Document

Computing / Computer architecture / Concurrent computing / Formal methods / Theoretical computer science / Cache coherency / Instruction set architectures / Concurrency / TLA+ / Model checking / Cache coherence / Specification language

Checking Cache-Coherence Protocols with TLA+ Rajeev Joshi HP Labs, Systems Research Center, Palo Alto, CA. Leslie Lamport Microsoft Research, Mountain View, CA.

DocID: 1xUq9 - View Document

Computer programming / Theoretical computer science / Software engineering / Logic in computer science / Computational complexity theory / Boolean algebra / NP-complete problems / Formal methods / Boolean satisfiability problem / Conditional / Reduction / Algorithm

The Straight-Line Automatic Programming Problem Rajeev Joshi, Greg Nelson, Yunhong Zhou HP Laboratories Palo Alto HPLNovember 20th , 2003* superoptimization,

DocID: 1xUem - View Document