Post: re: two's-complement addition
re: two's-complement addition →
Posted Tuesday 6th January 2009 14:29 GMT
In Don't shout at your disk drives, warns Sun engineer
John,
Is two's-complement addition really faster, or is does it just require fewer transistors (reuse those for addition when doing subtraction)? At one time minimizing transistors was very important, but today the question is usually how can you best use the available ones.
Is it time to reevaluate the choice between one's complement and two's complement arithmetic? A one's complementation (nice verb) is a simple XOR operation and does not require a bit flip to be propogated through an entire byte value. This would mean no spare bits left over to crash to the floor. Perhaps the noise associated with these bits was not as significant years ago when the processors were several orders of magnitude slower.
Most read
Popular Whitepapers
- Business-Critical Applications
The Benefits of Intel Xeon Processors and Windows Server 2008 R2 for Business-Critical Apps - Data Center Savings
Realizing Data Center Savings with an Accelerated Server Refresh Strategy - Virtualization with the Intel Xeon Processor 5500 Series
A proof of concept - The Great Virtualization Dilemma of the Next Decade
What You Need to Know - Out-of-box comparison between Dell, HP, and IBM blade servers
Receiving, unpacking and installing each system in the server rack - Real-world server consolidation with VMware vSphere 4
35 HP ProLiant DL385 servers onto 5 Dell PowerEdge M610 blade servers with VMware vSphere