|Modulo n arithmetics email@example.com (Christian Fabre) (1992-11-06)|
|Re: Modulo n arithmetics firstname.lastname@example.org (1992-11-10)|
|Re: Modulo n arithmetics email@example.com (David R. Clark) (1992-11-11)|
|Re: Modulo n arithmetics firstname.lastname@example.org (1992-11-11)|
|Modulo n arithmetics email@example.com (1992-11-11)|
|Re: Modulo n arithmetics wendt@CS.ColoState.EDU (1992-11-15)|
|Re: Modulo n arithmetics firstname.lastname@example.org (1992-11-17)|
|Re: Modulo n arithmetics email@example.com (1992-11-19)|
|[2 later articles]|
|From:||firstname.lastname@example.org (David Keppel)|
|Organization:||Computer Science & Engineering, U. of Washington, Seattle|
|Date:||Tue, 10 Nov 1992 22:52:02 GMT|
>[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
Return to the
Search the comp.compilers archives again.