operands into some groups, each having nearly uniform size. Let the size be b, then the group numbers m=⌊N.
Google Scholar
b⌋. Every group except the last one(possibly having over b operands. ) has b operands. The operands with other digits are also divided into m groups. The variables i, j and R are all initialized to 0, and S is initialized to D.
Google Scholar
m. ª Step 2: Judge whether S is greater than 255. If so, let R=S-255, S＝255, then go to Step 3. Or else, go to Step 3 directly. ª Step 3: Calculate which kinds of suanweis that can be used to constitute S data-bits. It's an S-bit compound suanwei if it is made up of different kinds of suanweis in Table 2. Otherwise, it is a single one. ª Step 4: Examine the remainders of involved suanweis to see whether the allocation can be met. If there are enough suanweis to allocate, decrease each remainder by 1, go to Step 5. Or else, the task is suspended, and a signal, data-bit reclaim request, is created and sent to the reclaim module. The task is blocked until a wake-up signal is received from the reclaim module. ª Step 5: Sequentially search for free suanweis. After every suanwei needed is found, its state is changed into 0" from "1", and its number is copied into corresponding entry in Table 3. ª Step 6: Copy User ID, Task ID and Operator ID into corresponding entries in Table 3. ª Step 7: Judge whether R is greater than 0. If so, increase j by 1, and fill it into entry FS in Table 3. Send the filled Table 3 to the underlying driver software. And let S=R, then jump to Step 2. Or else, fill 0 into FS, and jump to Step 8. ª Step 8: Send the involved operands to data manage module to take part in calculating. Increase i by 1 when the operation is nearly finished. Go to Step 9 if i is equal to p . Otherwise, let S= (D[i]-D[i-1])*m, and jump to Step 2. There is one difference that the justly allocated suanweis, with those the task has occupied, will be used to construct a D[i]-bit compound suanwei. ª Step 9: Exit from the allocation module. 5 An example Now an example is to explain DDBA as mentioned above. Suppose the usage of suanweis is shown in Table 2 when a task comes, and the operands are divided into three groups, 90 bits, 120 bits and 140 bits, whose numbers are 1250, 700, 900 respectively. If b designated by the system is 400, m=⌊1250/400⌋=3. Thus, the data with different bits are all divided into 3 groups, for 90-bit data into groups with 400, 400 and 450 respectively, for 120-bit data with 200, 200, 300 respectively, and for 140-bit data each with 300. According to Step 1, 270 data-bits should firstly be allocated to the task. A 255-bit compound suanwei should be allocated because 270 is greater than 255. Obviously, it needs one of each kind of suanwei. According to Table 2, there are enough suanweis to allocate. In other words, the suanweis with numbers 1, 17, 25, 33, 45, 55, 65 and 69 are allocated to construct the 255-bit suanwei. Their states are changed into "0" from "1", and each remainder is decreased by one. And the relevant contents are copied into corresponding position in newly created Table 3. It is sent to the underlying driver software to construct operators. After Step 7, a 15-bit suanwei should be allocated. The process is similar to the one to allocate the 255-bit suanwei. Thus, 270-bit suanwei is allocated for the 90-bit operands. Meanwhile, a signal is sent to the data manage module and it sends the involved data to take part in calculation. When the calculation is nearly complete, a suanwei with (120-90)×3=90 bits is allocated again. The justly allocated suanwei is combined with the former 270-bit one to implement 120-bit operation. Similarly, a 60-bit suanwei is allocated to accomplish 140-bit operation. As the example shown, the allocation module will allocate three suanweis with 270 bits, 90 bits and 60 bits to the task in three times to achieve the 90-bit, 120-bit and 140-bit operations respectively. 6 Conclusions The data-bit manage directly affects the whole performance of TOC. Meanwhile, it is an important component of TOC software system. More and more attentions have been paid to the novel problem, how to effectively allocate TOC data-bits. This paper has discussed how to dynamically allocate data-bits by using some technologies, such as static appointment of different suanwei width, static grouping of data-bits and the dynamic allocation process. Here we only have put forward the allocation strategy but haven, t conducted the experiment. The potential disadvantages will be improved in the coming experiment. This work was supported by the National Natural Science Foundation of China (NSFC) (61073049), and the Natural Science Research Project of Higher Education in Anhui (KJ2010B150). Referrences.
Google Scholar
[1]
Y. Jin, H. C. He, Y. T. Lǖ, Ternary optical computer principle, Sci. China Ser. F-Inf. Sci. 46 (2003) 145-150.
Google Scholar
[2]
J. Y. Yan, Y. Jin, K. Z. Zuo, Decrease-radix design principle for carrying / borrowing free multi-valued calculator and application in ternary optical computer, Sci. China Ser. F-Inf. Sci. 51 (2008) 1415-1426.
DOI: 10.1007/s11432-008-0140-z
Google Scholar
[3]
X. C. Wang, J. J. Peng, M. Li, et al, Carry-free vector-matrix multiplication on a dynamically reconfigurable optical platform, Appl. Opt. 49 (2010) 2352-2362.
DOI: 10.1364/ao.49.002352
Google Scholar
[4]
L. Teng, J. J. Peng, Y. Jin, et al, A cellular automata calculation model based on ternary optical computer, in: W. Zhang, Z.X. Cheng, C.C. Douglas, W.Q. Tong (Eds. ), 2nd International Conference on High Performance Computing and Applications, Springer-Verlag, Berlin, 2010, pp.377-383.
DOI: 10.1007/978-3-642-11842-5_52
Google Scholar
[5]
Y. Jin, Y. F. Shen, J. J. Peng, et al, Principles and construction of MSD adder in ternary optical computer, Sci. China Ser. F-Inf. Sci. 53 (2010) 2159-2168.
DOI: 10.1007/s11432-010-4091-9
Google Scholar
[6]
X. C. Wang, J. J. Peng, S. Ouyang, Control method for the optical components of a dynamically reconfigurable optical platform, Appl. Opt. 50 (2011) 662-670.
DOI: 10.1364/ao.50.000662
Google Scholar
[7]
Y. Jin, Management strategy of data-bits in ternary optical computer (in Chinese), Journal of Shanghai University (Natural Science) 13 (2007) 519-523.
Google Scholar
