The current shortage of {sup 18}O has revived interest in using one step UV photodissociation of formaldehyde to enrich {sup 13}C, {sup 17}O and {sup 18}O. The frequency doubled output of the copper laser pumped dye laser system currently in operation at LLNL can be used to drive this dissociation. The authors use a simple kinetics model and their experience with Atomic Vapor Laser Isotope Separation (AVLIS) process design to examine the relative merits of different designs for a formaldehyde photodissociation process. Given values for the molecular photoabsorption cross section, partition function, spectroscopic selectivity, collisional exchange and quenching cross sections (all as parameters), they perform a partial optimization in the space of illuminated area, formaldehyde pressure in each stage, and formaldehyde residence time in each stage. They examine the effect of cascade design (heads and tails staging) on molecule and photon utilization for each of the three isotope separation missions, and look in one case at the system`s response to different ratios of laser to formaldehyde costs. Finally, they examine the relative cost of enrichment as a function of isotope and product assay. Emphasis is as much on the process design methodology, which is general, as on the specific application …

In this paper we consider the problem of interprocessor communication on a Completely Connected Optical Communication Parallel Computer (OCPC). The particular problem we study is that of realizing an h-relation. In this problem, each processor has at most h messages to send and at most h messages to receive. It is clear that any 1-relation can be realized in one communication step on an OCPC. However, the best known p-processor OCPC algorithm for realizing an arbitrary h-relation for h > 1 requires {Theta}(h + log p) expected communication steps. (This algorithm is due to Valiant and is based on earlier work of Anderson and Miller.) Valiant`s algorithm is optimal only for h = {Omega}(log p) and it is an open question of Gereb-Graus and Tsantilas whether there is a faster algorithm for h = o(log p). In this paper we answer this question in the affirmative by presenting a {Theta} (h + log log p) communication step algorithm that realizes an arbitrary h-relation on a p-processor OCPC. We show that if h {le} log p then the failure probability can be made as small as p{sup -{alpha}} for any positive constant {alpha}.