The alternating group explicit (AGE), an explicit iterative method for parabolic problems involving regular domains of cylindrical symmetry is implemented in parallel

on a MIMD Sequent S27 system. The AGE method is suitable for parallel computers as it possesses separate and independent tasks, i.e (2 x 2) blocks which can be

executed at the same time without interfering with each other. This paper reports the development and implementation of the parallel AGE algorithm. The results

from parallel implementation are compared with those of the sequential implementation

Chuah, Chin Yew

Muda, Zaiton

Othman, Mohamed

Universiti Putra Malaysia Institutional Repository

Pertanika J. Sci. & Techno!. 2(2): 149-158 (1994)ISS : 0128-7680© Universiti Pertanian Malaysia PressA Parallel AGE Method for Parabolic Problemswith Special GeometriesZaiton Muda, Mohamed Othman and Chuah Chin YewDepartment of Computer ScienceFaculty ofScience and Environmental StudiesUniversiti Pertanian Malaysia43400 Serdang, Selangor DE, MalaysiaReceived 3 February 1993ABSTRAKKaedah tak tersirat kumpulan berselang-seli (TTKS) merupakan satu kaedahlelaran tak tersirat bagi masalah parabola yang melibatkan domain sekata telahdilaksanakan dalam sistem Sequent S27. Kaedah ITKS ini sesuai bagi komputerselari kerana ia mempunyai tugas-tugas yang terpisah dan merdeka, contohnya blok-blok (2 x 2) yang boleh dilaksanakan serentak tanpa melibatkan satu sama lain.Makalah ini menerangkan pembangunan dan perlaksanaan algoritma selari TTKS.Keputusan-keputusan yang diperolehi daripada perlaksanaan selari ini dibandingkandengan perlaksanaan secara jujukan.ABSTRACTThe alternating group explicit (AGE), an explicit iterative method for parabolicproblems involving regular domains ofcylindrical symmetry is implemented in parallelon a MIMD Sequent S27 system. The AGE method is suitable for parallel computersas it possesses separate and independent tasks, i.e (2 x 2) blocks which can beexecuted at the same time without interfering with each other. This paper reportsthe development and implementation of the parallel AGE algorithm. The resultsfrom parallel implementation are compared with those of the sequential imple-mentation.Keywords: parallel AGE, parallel computer, MIMDINTRODUCTIONLet us consider the following parabolic equation in one-space dimensiongiven byauata2u ex au-+-ar2 r ar (1.1)subject to the initial-boundary conditionsU(r, 0) = f(r), 0'5:1''5:1and au- (0, t)= 0, U(l, t)= 0, forO '5: t'5: Tau(1.2)Zaiton Muda, Mohamed Othman and Chuah Chin YewThis equation reduces to the simple diffusion equation when a = 0 and byputting a = 1 and a = 2 respectively, it becomes a parabolic problem withcylindrical and spherical symmetry. The application of the AGE algorithm tothe heat equation (Evans and Sahimi 1987) is now extended for problem (1.1).PROBLEM FORMULATIONA uniformly-spaced network whose mesh points are r i = iLlr, t =jM for i = 0,1, ..., m, m +1 andj = 0,1, ... , n, n +1 is used with M = Ij(m +1): M= Tj(n +1)and mesh ratio 'A = Mj (Llr)2.IrmFig. 1A weighted approximation to (1.1) at the point (ri , ~+l) is thus given bySaul'yev (1964),[1 + 2(1 + a)'A8]uO,j+1 - 2(1 + a)'A8u1•j +1 = [1- 2(1 + a)'A(I- 8)uO,j+ 2(1 + a)'A(1- 8)u1,j (2.1)at the axis r = 0 and- p.8u. 1 . 1 + (1 + 2Ae)u1 . 1 - q8u. I . 1 = p. (1- 8)u. 1 .I I-,j+ .j+ I 1+,j+ 1 1- ,J+[1 - 2'A(1- 8) ]u.. + q.(I- 8)u. 1 .l,j 1 1+ ,Jfor i = 1, 2, ... , m and points not on the axis, whereandqi = (1 + a/2i)'A.(2.2)Following Sahimi and Muda (1988), approximations (2.1) and (2.2)may bewritten asao boo ll~ I~~ lc1 a l b lc2 a2 b2 f2() Cm-l am_ l ~:'J l~:' fm_lcm-l fmor Ag=f. (2.3)150 Pertanika J. Sci. & TechnoL VoL 2 No.2, 1994A Parallel AGE Method for Parabolic Problems with Special Geometrieswhereao= 1 + 2(1 + a)'A8,bo = - 2(1+ a)'A8,a t =a=(1+2A8),for i=1,2, ...,m;bi = - qi 8, for i = 1, 2, ... , m;c i = - Pi8, for i = 1, 2, ... , m;fo = [1- 2(1 + a)'A (1-8)]uo./ 2(1 + a) A (1-8)]u1•jf. = p. (1- 8)u. I' + [1- 2'A(1- 8)]u.. + q. (1- 8)]u. 1 .,J I I-J l.j I It,Jfor i = 1,2, ..., m - 1;fm= Pm (1- 8)um_ l •j + [1 - 2'A(1 - 8)]um,j + qm [8um+l •j +1+ (1-8)]um+I)·Note that (2.3) corresponds to the fully implicit, the Crank-Nicolson and theclassical explicit methods when 8 = 1, 1/2, and 0 respectively with 0 «M)2 +M), 0 «~r)2 + (M)2) and 0 «~r)2 + M) accuracy.Without loss of generality, assume that m is odd. Then, we have an evennumber (m + 1) of internal mesh points at which we seek the solutions of (2.3)along each time level. We now perform the following splitting ofA:(2.4)where~ ao ~: a ~ ()····························~····~··a········b~······r j .G1 = ~ c3 1/2 a ~. ~ (2.5)............................: ~ ': .. ... " .............................; · i················i .o ~ 1/2 a bm_1c 1/2 am (m+l) x (m+l)Pertanika J. Sci. & Techno!. Vo!. 2 No.2, 1994 lSIZaiton Muda. Mohamed Othman and Chuah Chin Yew~a !........~ ~ ~ , , , .~ ~ a b l ~ ~ ~ ( ) ~: c ~a:: :: 2 : : . :···········T···················l···~·~···b~····T·· ~ j .G2 ~ ~ c4 ~ a ~. ~ j (2.6)···········1···················1"···················1·········:·l····················I······.. ·············l······(···)··········I·················:··\... ~ .. ·······I···~·~····b~~~t·········~ ~ ~ ! c ~a!···········+····················f····················j + ':!-;-!•...•..•.••+ .: : :: : ~a• • '. • (m+l) x (m+l)Following Evans and Sahimi (1987), the following iterative AGE conver-gent scheme was derived,(G + rI)l!(k+l/2) = (fl - G )U(k) + fI 2 - -+ (2 - w) [l!(k+l/2) (2.7)for any 0 ~ w~ 2 and r > 0 being a fixed acceleration parameter along eachintermediate (half-time) level or iterate. A particular choice of w= 0 gives usthe Peaceman-Rachford (PR) scheme and for w= 1, we obtain the variant dueto Douglas and Rachford (DR). Both stable variants are known to havetruncation errors of the order T pR= 0 ((L'lr)2 + (M)2) and TOR ((L'lr)2 + M)respectively.Following Sahimi and Muda (1988) we arrive at the computation of thesolution of our geometrical problem:1) at level (k + 1/2)U (k+1/2) = (A U (k) + B U (k) + C U (k) + D )/ ao 00 01 02 0 0U (k+1/2) = (A U (k) + B U (k) + C U (k) + D )/ aI I 0 1 1 1 2 1 0U(k+l/2) = (Au. (k) + Bu (k) + Gu (k) + Uu (k)+ E.) / a1 I 1-1 1 1 1+1 I 1+2 I 1/2152for i = 2, 4, 6, ... , m - 1u. (k+l/2) = (Au (k)+ BU(k) + Bu. (k)+ C.u (k)+ D.)/a.1+1 1 I-I 1 1 HI 1 1+2 I 1/2for i = 2, 4, 6, ..., m -1Pertanika J. Sci. & Technol. Vol. 2 No.2. 1994(2.8a)(2.8b)A Parallel AGE Method for Parabolic Problems with Special Geometrieswherewith2) at level (k + 1)s= r + a/2, So = r - ao/2, and s = r - a/2.U (k+l) = (q U (k) + d U (ktl/2)Isa 00 00 aU(ktl) = (P.U(k) + Qu. (k) + Ru. (ktl/2) + S.U. (ktl/2) I&...I I I 1+1 1 I 1+1 (1+1)/2for i = 1, 3, 5, ... , m - 2U. (ktl) = (P.U(k) + P.u. (k) + Q-.U(k+ 1/2»+ Ru. (k) la.1+1 I 1 1 1+1 1 1+1 (1+1)/2for i = 1, 3, 5, ..., m - 2where(2.9a)(2.9b)withQ= bJs - q), R=sd, S=- bd1 1qo = a/2 - (1 - co)1', q=a/2-(l -co)f and d=(2-co)f.Since the equations 2.8a & 2.8b and 2.9a & 2.9b are explicit, thentheir solution on a parallel computer is possible.PARALLEL AGE EXPLOITATIONA parallel algorithm has been developed and implemented to solve theone-space dimension parabolic equation on a MIMD shared memoryparallel computer.Pertanika J. Sci. & Techno!. Vo!. 2 No.2, 1994 153Zaiton Muda, Mohamed Othman and Chuah Chin YewThe mesh of points (Fig. 1) is decomposed into a subset of points,each of which is assigned to a processor. As we have seen, the computationof the solution of our geometrical problem involves iterations of the twosweeps.For the first sweep of each mesh point, each computational moleculeof equations 2.8a & 2.8b is again assigned to a processor. The computationalmolecules are then solved depth by depth in parallel in bottom-up order(Fig. 2(a)). This method is also known as the balanced binary tree method.The depth of such a tree will be bound by (log n) and the complexityof such an algorithm will be 0 (log n) where n is the number of nodes.The maximum number of processors employed in this discipline is n/2.( CD+Ei )/Ui/2 ( 0+ Di )/Ui/28/ '8 8/,8?' ,.?1 ? "'"0 0 0 0 0 0 0 0l' ~ ~~ /'~ Jf~ 7' ~ f "" ;7 ~ ! tA U i_1 B U. C. u j+1 D j U i+2 A U i_1 B. U. B u j+1 Cj u j+21 1 I I I Ifor i = 2, 4, ... , m - 1Fig.2(a)for i = 3, 5, ..., mThe second sweep is started after the first sweep has been completed. Thecomputational molecules of equation 2.9a & 2.9b are also solved using thesame technique (Fig. 2(b)). Then a test of convergence is carried out after thesecond sweep. Further iterations are needed until a prescribed tolerance c isachieved.for i = 1, 3, ... , m - 2 for i = 2, 4, ... , m - 1154Fig.2(b)Pertanika J. Sci. & Techno!. Vo!. 2 No.2, 1994A Parallel AGE Metho(j for Parabolic Problems with Special GeometriesThe algorithm for the parall~lAGE method is then described as follows,Algorithm beginfor h = 1 to n dobeginT=htk=Owhile (not converge) and (k <MAX)begink=k + 1U (k+l/2) =o ,.,U (k+l/2) =I ...for i = 2 to m-l in parallel dobeginfor j = 4 to 7 in parallel doA. =A 2*A 2.I,J I, ~ I, ~+lfor j = 2 to 3 in parallel doA. =A 2· +A 2.1,] 1, ~ l,z.)+1U(k+l/2) = (A +A + A )/a.I 1,2 1,3 1,4 1endU(k+l) = ...f~r i = 1 to m-2 in parallel dobeginfor j = 4 to 7 in parallel doB.. = B 2 * B 2·1,] 1, I, :]+1for j = 2 to 3 in parallel doB. = B 2 + B 2'I,J I, ~ I, ~+lU(k+l) = (B + B. ) * la.I 1,2 1,3 1endTest Convergence[abs(u(k+l) - U(k») < £ for all i]Repla~e u. (k+l) ~th new u. (k) for all i1 IendendAlgorithm end.As the method of divide-and-conquer (Evans and Sutti 1988) is widelyapplicable in sequential computation, a sequential program is developed andimplemented to give its performance in contrast with the parallel.EXPERIMENTAL RESULTSLet us consider the cylindrical problem (Mitchell and Pearce 1963)auata2u 1 au+ (O::;;r::;;l)Pertanika J. Sci. & TechnoL VoL 2 No.2, 1994 155Zaiton Muda, Mohamed Othman and Chuah Chin YewU(l, t) = 0,U(r, 0) = Jo(Br> ,au-(0, t)aut>Owhere Jo (Br) is the Bessel function of the first kind of order 0 and B isthe first root of Jo(B) = O. The exact solution is U(r, t) = Jo(Br)e-~2t.This problem is implemented in parallel as well as in sequential onthe sequent symmetry S27 system using the strategy discussed above. Theprograms are written in C language; compiled with the Symmetry C Compiler(version 6.2). The Sequent computer runs on the DYNIX operating system,a version of UNIX 4.2bsd that also supports most utilities, libraries andsystem calls provided by UNIX System V. Here the Sequent computer supportsmulti-tasking on 2 processors.The accuracy of these parallel AGE method results has been verified(Fig. 3(a) with the implicit-sequential results obtained from Sahimi andMuda (1988).0.0020.00180.00160.0014~ 0.0012oto 0.001Q)Q) 0.0008:;""60.0006~ 0.00040.00020+---+--;----+--+---+--+---+--+--<oT-:C\J(T)'Vll)WC'---COC)°ooci cieidcid__ AGE (DR) imp/jct-sequential........ AGE (DR) implict-parallelFig. 3(a). The absolute f!TT(ffS of the numerical solutions to the cylindrical problems (whereA. = 1.0, t = 1.0, AT = 0.1, At = 0.01, r = 0.9, (0 = 1)In the implementations, the execution time of the two sweeps is obtainedwith the number of mesh points being increased (Table 1). By comparingthe results of the implementations, we notice that the processing timesfor the parallel strategy are less than those of the sequential strategy (Fig.3 (b) & 3(c). This is mainly due to the effectiveness of the algorithm whichenables a high percentage of the problem to be parallelized (in equations2.8a, 2.8b, 2.9a and 2.9b).156 Pertanika J. Sci. & Technol. Vol. 2 No.2, 1994A Parallel AGE Method fo~ Parabolic Problems with Special Geometries400035003000~§ 2500~ 2000.~ 15001000500o +--......_---+-_~--+-----t_~......__+_.....OC\lv CDCDOC\l v CDCDO~...- ,....,....C\JC\1 C\J C\JC\J("I')no. of mesh points- sequenlialalgorithm--0- parallel algorithmFig. 3(b). The time execution performance of the first sweep400035003000·m-g 2500ol!l 2000E(,) 1500'E10005000+-+--+----+---+---+---+---+--;---;----1o C\l v CD CD 0 C\l v CD CD 0,.... ,.... ,.... ,.... C\J C\J C\1 C\J C\J ~no. of mesh points_____ sequential algorithm--0-- parallel algorithmFig. 3(c). The time execution performance of the second sweep1.071.0681.066 '/ '--+-'g. 1.064, 1.062~ 1.06Q) 1.058f5 1.0561.0541.0521.0510no. of mesh pointso 1st sweep• 2nd sweep28 302nd sweep1st sweepFig. 3(c). Comparison of the speed-up of the parallel AGE methodPertanika J. Sci. & Techno!. Vo!. 2 No.2, 1994 157Zaiton Muda, Mohamed Othman and Chuah Chin YewTABLE 1The execution time (in microseconds) and speed-up performance of the parallelAGE method (where A = 1.0, t = 1.0, Llr = 0.1, bt = 0.01, r = 0.9, (J) = 1)sequential parallel algorithm parallel speed-upno. of algorithmmeshpoints 1st 2nd 1st 2nd 1st 2ndsweep sweep sweep sweep sweep sweep10 1035 1012 979 950 1.057201 1.06526312 1293 1264 1220 1185 1.059836 1.06666714 1558 1516 1467 1420 1.062031 1.06760616 1822 1767 1721 1661 1.058687 1.06381718 2065 2024 1947 1895 1.060606 1.06807420 2323 2274 2194 2135 1.058797 1.06510522 2589 2529 2443 2373 1.059763 1.06657424 2841 2782 2678 2617 1.060866 1.06304926 3095 3028 2926 2846 1.057758 1.06394928 3353 3279 3166 3078 1.059065 1.06530230 3613 3595 3410 3373 1.059531 1.065904In Fig. 3(d), the speed-up for the first sweep is less than the second.This is because the second sweep has a higher percentage of parallelismthan the first. Due to the limitation factor of hardware facilities (that isthe number of processors is two), further conclusions on speed-up for morethan two processors cannot be made. However, we expect a better speed-up as we increase the number ofprocessors. This will mean more subproblemscan be solved simultaneously.REFERENCESEVANS, D. J. and M.S. SAHIMI. 1987. Alternating group explicit iterative method (AGE)to solve parabolic and hyperbolic partial differential equations. In Ann. Rev. Num.Fluid. Mech. & Heat Trans. ed. Chong Lin Tien, 2nd ed. Hemisphere Pub. Co.EVANS, DJ. and C. SUIT!. 1988. Parallel Computing Methods, Algorithms and Applications.Adam Hilger.MrrcHELL,A.R. and R.P. PEARCE. 1963. Explicit difference methods for solving the cylindricalheat conduction equation. Maths. Compo 17: 426-432.PEACEMAN, D.W. and RH. RACHFORD. 1955. The numerical solution of parabolic andelliptic differential equations. J Soc. Indust. Appl. Maths. 3: 28-41.SAHIMI, M.S. and Z. MUDA. 1988. An iterative explicit method for parabolic problemswith special geometries. UKM Tech. Report. PPK/Mac 88/LT 7.SAUL'YEV, V. K. 1984. Integration ofEquations ofParabolic Type by the Method of Nets. Oxford:Pergamon Press.158 Pertanika J. Sci. & Technol. Vol. 2 No.2, 1994

A Parallel AGE Method for Parabolic Problems

with Special Geometries

http://psasir.upm.edu.my/3103/1/A_Parallel_AGE_Method_for_Parabolic_Problems.pdf

A Parallel AGE Method for Parabolic Problems with Special Geometries

Abstract

Similar works

Full text

Available Versions

Universiti Putra Malaysia Institutional Repository