Loading...
Please wait, while we are loading the content...
Similar Documents
A parallel program that generates the Mo¨bius sequence
| Content Provider | Semantic Scholar |
|---|---|
| Author | Rem, Marijke Verhoeff, Tom |
| Copyright Year | 1988 |
| Abstract | A CSP-like parallel program that generates the Mobius sequence is derived from its specification. The program has constant response time. It can be generalized to other sequences based on arithmetical functions. like the Euler function. O. INTRODUCTION We start by defining the Mobius sequence and specifying. in the style of [0]. a computation that generates this sequence. In the major section of this paper we derive a parallel program from that specification. We analyze the response time of the resulting program. We also indicate how the program can be generalized to generate other sequences. Finally. we summarize the design techniques that were applied. For integer n . n '" 1. let 7T(n ) denote the number of (distinct) prime divisors of n. Since 1 is not considered prime. we have 7T(1) = O. For n "'2 we have 7T(n)'" 1: for example: 7T(2) = 1. 7T(4) = 1. and 7T(6) = 2. The Mobius function p. is defined for positive integers by if (E m : m > 1: m 2 1 n) otherwise. Parallel Program lor MObius Sequence |
| Starting Page | 171 |
| Ending Page | 182 |
| Page Count | 12 |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://pure.tue.nl/ws/files/2225523/8839487.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
