**10. References**


Kleitman, D. J. & Spencer, J. (1973). Families of k-independent sets, *Discrete Math* 6(3): 255–262.

Using Grid Computing for Constructing Ternary Covering Arrays 245

Lei, Y., Kacker, R., Kuhn, D. R., Okun, V. & Lawrence, J. (2007). IPOG: A general strategy for

Society, pp. 549–556. http://dx.doi.org/10.1109/ECBS.2007.47. Lei, Y. & Tai, K.-C. (1998). In-parameter-order: A test generation strategy for pairwise

Martinez-Pena, J., Torres-Jimenez, J., Rangel-Valdez, N. & Avila-George, H. (2010). A heuristic

Martirosyan, S. S. & Colbourn, C. J. (2005). Recursive constructions of covering arrays,

Moscicki, J., Brochu, F., Ebke, J., Egede, U., Elmsheuser, J., Harrison, K., Jones, R., Lee, H.,

Moura, L., Stardom, J., Stevens, B. & Williams, A. (2003). Covering arrays with mixed alphabet

Nurmela, K. J. (2004). Upper bounds for covering arrays by tabu search, *Discrete Appl. Math.* 138: 143–152. http://dx.doi.org/10.1016/S0166-218X(03)00291-9.

Sherwood, G. (2011). On the construction of orthogonal arrays and covering arrays using

Sherwood, G. B. (2008). Optimal and near-optimal mixed covering arrays by column

Shiba, T., Tsuchiya, T. & Kikuno, T. (2004). Using artificial life techniques to generate test

expansion, *Discrete Mathematics* 308(24): 6022 – 6035. http://dx.doi.org/10.

cases for combinatorial testing, *Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01 - COMPSAC 2004*, IEEE Computer Society, pp. 72–77. http://dx.doi.org/10.1109/CMPSAC.2004.1342808. Surridge, M., Taylor, S., Roure, D. D. & Zaluska, E. (2005). Experiences with gria - industrial

applications on a web services grid, *Proceedings of the First International Conference on*

Pacini, F. (2001). Job description language howto. Accessed on October 10, 2011.

Rényi, A. (1971). *Foundations of Probability*, John Wiley & Sons, New York, USA.

permutation groups. Accessed on June 20, 2011. URL: *http://testcover.com/pub/background/cover.htm*

1016/j.disc.2007.11.021.

Liko, D., Maier, A., Muraru, A., Patrick, G., Pajchel, K., Reece, W., Samset, B., Slater, M., Soroko, A., Tan, C., van der Ster, D. & Williams, M. (2009). Ganga: A tool for computational-task management and easy access to grid resources, *Comput Phys Commun* 180(11): 2303–2316. http://dx.doi.org/10.1016/j.cpc.2009.06.

sizes, *Journal of Combinatorial Designs* 11(6): 413–432. http://dx.doi.org/10.

URL: *http://server11.infn.it/workload-grid/docs/DataGrid01TEN01020\_2-Document.pdf* Ram, D. J., Sreenivas, T. H. & Subramaniam, K. G. (1996). Parallel simulated annealing algorithms., *Journal of Parallel and Distributed Computing* 37(2): 207–212.

t-way software testing, *Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems - ECBS 2007*, IEEE Computer

testing, *Proceedings of the 3rd IEEE International Symposium on High-Assurance Systems*

approach for constructing ternary covering arrays using trinomial coefficients, *Proceedings of the 12th Ibero-American Conference on Artificial Intelligence - IBERAMIA 2010*, Vol. 6433 of *Lecture Notes in Computer Science*, Springer-Verlag, pp. 572–581.

http://dx.doi.org/10.1016/0012-365X(73)90098-8.

*Engineering - HASE 1998*, IEEE Computer Society, pp. 254–261.

http://dx.doi.org/10.1007/978-3-642-16952-6\_58.

McDowell, A. G. (2011). All-pairs testing. Accessed on June 21, 2011. URL: *http://www.mcdowella.demon.co.uk/allPairs.html*

*Bayreuth. Math. Schr.* 74: 266–275.

016.

1002/jcd.10059.


URL: *http://www.complexsystems.com/abstracts/v15\_i04\_a04.html*

Katona, G. O. H. (1973). Two applications (for search theory and truth functions) of sperner type theorems, *Periodica Math.* 3(1-2): 19–26. http://dx.doi.org/10.1007/ BF02018457.

24 Grid Computing

Cavique, L., Rego, C. & Themido, I. (1999). Subgraph ejection chains and tabu

Cohen, D. M., Dalal, S. R., Parelius, J. & Patton, G. C. (1996). The combinatorial design

Cohen, M. B., Colbourn, C. J. & Ling, A. C. H. (2003). Augmenting simulated annealing to

Colbourn, C. (2004). Combinatorial aspects of covering arrays, *Le Matematiche* 58: 121–167. Colbourn, C. J. (2011). Covering array tables for t=2,3,4,5,6. Accessed on April 20, 2011.

Colbourn, C. J. & Kéri, G. (2009). Binary covering arrays and existentially closed graphs,

Colbourn, C. J. & Ling, A. C. H. (2009). A recursive construction for perfect hash families,

Colbourn, C. J., Martirosyan, S. S., Mullen, G. L., Shasha, D., Sherwood, G. B. & Yucas,

Colbourn, C. J. & Torres-Jimenez, J. (2010). Error-Correcting Codes, Finite Geometries

Gonzalez-Hernandez, L., Rangel-Valdez, N. & Torres-Jimenez, J. (2010). Construction of

Jun, Y. & Mizuta, S. (2005). Detailed analysis of uphill moves in temperature parallel

Katona, G. O. H. (1973). Two applications (for search theory and truth functions) of sperner

mixed covering arrays of variable strength using a tabu search approach, *Proceedings of the 4th international conference on Combinatorial optimization and applications - COCOA 2010*, Vol. 6508 of *Lecture Notes in Computer Science*, Springer-Verlag, pp. 51–64.

simulated annealing and enhancement of exchange probabilities, *Complex Systems*

type theorems, *Periodica Math.* 3(1-2): 19–26. http://dx.doi.org/10.1007/

12(2): 124–138. http://dx.doi.org/10.1002/jcd.20065.

gLite (2011). Lightweight middleware for grid computing. Accessed on June 6, 2011.

http://dx.doi.org/10.1007/978-3-642-17458-2\_6.

URL: *http://www.complexsystems.com/abstracts/v15\_i04\_a04.html*

*Contemporary Mathematics* 523: 3–15. ISBN-10 0-8218-4956-5. DIANE (2011). Distributed analysis environment. Accessed on June 6, 2011.

URL: *http://it-proj-diane.web.cern.ch/it-proj-diane/* EGI (2011). European grid initiative. Accessed on September 6, 2011.

Globus Alliance (2011). Globus toolkit. Accessed on May 21, 2011.

01605682/1999/00000050/00000006/2600728.

dx.doi.org/10.1109/ISSRE.2003.1251061.

dx.doi.org/10.1007/978-3-642-01877-0\_3.

URL: *http://www.public.asu.edu/ ccolbou/src/tabby/catable.html*

org/10.1109/52.536462.

JMC.2009.018.

URL: *http://www.egi.eu/*

URL: *http://glite.cern.ch/*

15(4): 349–358.

BF02018457.

URL: *http://www.globus.org/toolkit/*

search for the crew scheduling problem, *The Journal of the Operational Research Society* 50(6): 608–616. http://www.ingentaconnect.com/content/pal/

approach to automatic test generation, *IEEE Software* 13(5): 83–88. http://dx.doi.

build interaction test suites, *Proceedings of the 14th International Symposium on Software Reliability Engineering - ISSRE 2003*, IEEE Computer Society, pp. 394–405. http://

*Proceedings of the 2nd International Workshop on Coding and Cryptology - IWCC 2009*, Vol. 5557 of *Lecture Notes in Computer Science*, Springer-Verlag, pp. 22–33. http://

*Journal of Mathematical Cryptology* 3(4): 291–306. http://dx.doi.org/10.1515/

J. L. (2006). Products of mixed covering arrays of strength two, *J. Combin. Designs*

and Cryptography. Chapter: Heterogeneous Hash Families and Covering Arrays,


**0**

**11**

*Italy*

**Grid Infrastructure for Domain Decomposition**

The accurate and efficient solution of Maxwell's equation is the problem addressed by the scientific discipline called Computational ElectroMagnetics (CEM). Many macroscopic phenomena in a great number of fields are governed by this set of differential equations: electronic, geophysics, medical and biomedical technologies, virtual EM prototyping, besides the traditional antenna and propagation applications. Therefore, many efforts are focussed on the development of new and more efficient approach to solve Maxwell's equation. The interest in CEM applications is growing on. Several problems, hard to figure out few years ago, can now be easily addressed thanks to the reliability and flexibility of new technologies, together with the increased computational power. This technology evolution opens the possibility to address large and complex tasks. Many of these applications aim to simulate the electromagnetic behavior, for example in terms of input impedance and radiation pattern in antenna problems, or Radar Cross Section for scattering applications. Instead, problems, which solution requires high accuracy, need to implement full wave analysis techniques, e.g., virtual prototyping context, where the objective is to obtain reliable simulations in order to minimize measurement number, and as consequence their cost. Besides, other tasks require the analysis of complete structures (that include an high number of details) by directly simulating a CAD Model. This approach allows to relieve researcher of the burden of removing useless details, while maintaining the original complexity and taking into account all details. Unfortunately, this reduction implies: (a) high computational effort, due to the increased number of degrees of freedom, and (b) worsening of spectral properties of the linear system during complex analysis. The above considerations underline the needs to identify appropriate information technologies that ease solution achievement and fasten required elaborations. The authors analysis and expertise infer that Grid Computing techniques can be very useful to these purposes. Grids appear mainly in high performance computing environments. In this context, hundreds of off-the-shelf nodes are linked together and work in parallel to solve problems, that, previously, could be addressed sequentially or by using supercomputers. Grid Computing is a technique developed to elaborate enormous amounts of data and enables large-scale resource sharing to solve problem by exploiting distributed scenarios. The main advantage of Grid is due to parallel computing, indeed if a problem can be split in smaller tasks, that can be executed independently, its solution calculation fasten up considerably. To exploit this advantage, it is necessary to identify a technique able to split original electromagnetic task into a set of smaller subproblems. The Domain Decomposition (DD) technique, based on the block generation algorithm introduced in Matekovits et al.

**1. Introduction**

**Methods in Computational ElectroMagnetics**

Olivier Terzo, Pietro Ruiu, Lorenzo Mossucca,

*Istituto Superiore Mario Boella (ISMB)*

Matteo Alessandro Francavilla and Francesca Vipiana

*e-Science and Grid Computing*, IEEE Computer Society, pp. 98–105. http://dx.doi. org/10.1109/E-SCIENCE.2005.38.

