home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lsi
- Path: sparky!uunet!charon.amdahl.com!pacbell.com!ames!agate!doc.ic.ac.uk!mrccrc!warwick!pavo.csi.cam.ac.uk!swm11
- From: swm11@cl.cam.ac.uk (Simon Moore)
- Subject: hardware sorting
- Message-ID: <1992Nov6.165407.21814@infodev.cam.ac.uk>
- Keywords: hardware, sorting, earliest-deadline-first scheduling
- Sender: news@infodev.cam.ac.uk (USENET news)
- Nntp-Posting-Host: nene.cl.cam.ac.uk
- Organization: U of Cambridge Computer Lab, UK
- Date: Fri, 6 Nov 1992 16:54:07 GMT
- Lines: 16
-
-
- I have a requirement for a hardware sorter to sort
- deadlines for high speed real-time earliest deadline
- first scheduling. New deadlines can arrive at a peak
- rate of one every cycle and the earliest deadline
- needs to be extracted every 8 cycles.
-
- I would be very interested in anyone who has come
- across any hardware to perform such high speed
- sorting. (N.B. Batcher sorting networks are not
- practical because they require several cycles to
- sort a single set of values.)
-
- - Simon
-
- [Simon Moore][University of Cambridge, Computer Laboratory][swm11@cl.cam.ac.uk]
-