http://qs321.pair.com?node_id=902775

greatdane has asked for the wisdom of the Perl Monks concerning the following question:

I would like to simulate a datapath design using perl. The data path will have FIFOS, PIPES, MUXES and ARBS. Any suggestion on how I should go about coding these elements in perl? For example, how would I code a FIFO of depth N that I can instance M times and independently push/pop?

Replies are listed 'Best First'.
Re: perl datapath simulator
by mykl (Monk) on May 04, 2011 at 12:03 UTC

    This sounds like a question about the modelling of IC hardware using Perl. Is there a particular reason you want to use Perl rather than VHDL or Verilog, which are usually used for these jobs?

    At a basic level, I could answer your question by saying "Use @arrays for FIFOs and pipes, use array indexing for muxes, use if/then for arbitrators". This way you could write the whole thing in basic Perl.

    But maybe you are after something more sophisticated - maybe bounds-checking, performance measurements, data-driven path construction? If you give us some more details about what you are trying to achieve, we may be able to be more helpful.

    --

    "Any sufficiently analyzed magic is indistinguishable from science" - Agatha Heterodyne

Re: perl datapath simulator
by Anonymous Monk on May 04, 2011 at 00:41 UTC