Article View: comp.arch
Article #12253Re: Branchless conditionals (Was: More on Linpack pivoting)
From: Herman Rubin
Date: Tue, 25 Jun 1991 12:44
Date: Tue, 25 Jun 1991 12:44
9 lines
920 bytes
920 bytes
This is the old conditional skip, unused in most "modern" architectures.
This works well on sequential machines, but has it been implemented efficiently
on the faster non-sequential ones?
--
Herman Rubin, Dept. of Statistics, Purdue Univ., West Lafayette IN47907-1399
Phone: (317)494-6054
hrubin@l.cc.purdue.edu (Internet, bitnet) {purdue,pur-ee}!l.cc!hrubin(UUCP)
Technical Details
Message-ID:
<13947@mentor.cc.purdue.edu>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!sample.eng.ohio-state.edu!purdue!mentor.cc.purdue.edu!pop.stat.purdue.edu!hrubinReferences:
<1991Jun14.173510.22510@dg-rtp.dg.com> <32580036@hpcuhe.cup.hp.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!sample.eng.ohio-state.edu!purdue!mentor.cc.purdue.edu!pop.stat.purdue.edu!hrubin From: hrubin@pop.stat.purdue.edu (Herman Rubin) Newsgroups: comp.arch Subject: Re: Branchless conditionals (Was: More on Linpack pivoting) Message-ID: <13947@mentor.cc.purdue.edu> Date: 25 Jun 91 12:44:10 GMT References: <1991Jun14.173510.22510@dg-rtp.dg.com> <32580036@hpcuhe.cup.hp.com> Sender: news@mentor.cc.purdue.edu Lines: 9