Sorting scheme without compare and branch instructions

Details Sorting scheme without compare and branch instructions Sorting scheme without compare and branch instructions

1996-05-09

1998-05-12

Pan, Daniel H.

Boots, shoes, and leggings

36471506, 39580036, 39580024, G06F 708, G06F 742

Patent

active

057520720

ABSTRACT:
A sorting scheme which does not require any compare or branch instructions is particularly useful for computers with multiple parallel functional units. Sorting two numbers or binary strings is performed using arithmetic instructions instead of conventional compare and branch instructions, thereby improving the performance of superscalar and very large instruction word (VLIW) computers. When applied to reduced instruction set computers (RISC), the sorting scheme provides better utilization of floating-point units. The sorting scheme allows floating point representation of data and floating-point instructions to sort binary strings.

REFERENCES:
patent: 3727078 (1973-04-01), Wollesen
patent: 3890462 (1975-06-01), Limb et al.
patent: 4135147 (1979-01-01), Riganati et al.
patent: 5121494 (1992-06-01), Dias et al.
"IEEE Standard for Binary Floating-Point Authentic", IEEE, Inc, N.Y. 1985 pp. 7-18.

Affiliated with

Also associated with

Rating

Sorting scheme without compare and branch instructions does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Sorting scheme without compare and branch instructions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sorting scheme without compare and branch instructions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-995027