Tue, 10 Nov 1992 22:52:02 GMT

Related articles |
---|

Modulo n arithmetics fabre@gr.osf.org (Christian Fabre) (1992-11-06) |

Re: Modulo n arithmetics pardo@cs.washington.edu (1992-11-10) |

Re: Modulo n arithmetics drclark@daisy.uwaterloo.ca (David R. Clark) (1992-11-11) |

Re: Modulo n arithmetics dneedham@oucsace.cs.ohiou.edu (1992-11-11) |

Modulo n arithmetics wchsieh@beethoven.lcs.mit.edu (1992-11-11) |

Re: Modulo n arithmetics wendt@CS.ColoState.EDU (1992-11-15) |

Re: Modulo n arithmetics johnr@ee.uts.edu.au (1992-11-17) |

Re: Modulo n arithmetics chris@gargoyle.uchicago.edu (1992-11-19) |

[2 later articles] |

Newsgroups: | comp.compilers |

From: | pardo@cs.washington.edu (David Keppel) |

Organization: | Computer Science & Engineering, U. of Washington, Seattle |

Date: | Tue, 10 Nov 1992 22:52:02 GMT |

References: | 92-11-029 |

Keywords: | arithmetic |

*>[Applications that rely heavily on modular arithmetics?]*

I don't know if this counts as ``heavily'', but many buffering and

queueing schemes rely on modulo arithmetic. In some applications,

buffering and queuing are a substantial part of the total execution time.

Examples include some kinds of simulation and real-time event processing.

*>[Please reply by news.]*

Well, OK, but it's nice when the original poster will summarize,

particularly when I'm replying with these ``I don't know if this is

what you mean'' kinds of answers.

;-D on ( Daily reminder theorem ) Pardo

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.