Skip to main content
Springer Nature Link
Log in

Node set optimization problem for complete Josephus cubes

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

The problem of finding an optimal node set in an interconnection network plays an important role in minimizing the layout of embedding the network into linear chassis. In this paper we find the nested optimal node sets for a complete Josephus cube, a recently proposed fault-tolerant node cluster architecture variant of the binary hypercube which has the same number of nodes as the hypercube but exhibits enhanced embedding, fault tolerance and communications performance than the hypercube and many of its variants. As a byproduct we obtain the minimum layout of embedding the complete Josephus cube into a path, 1-rooted complete binary tree, sibling tree and caterpillar.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Adolphson AD (1977) Single machine job sequencing with precedence constraints. SIAM J Comput 6(1):40–54

    Article  MathSciNet  MATH  Google Scholar 

  • Arockiaraj M, Manuel P, Rajasingh I, Rajan B (2011) Wirelength of \(1\)-fault hamiltonian graphs into wheels and fans. Inf Process Lett 111:921–925

    Article  MathSciNet  MATH  Google Scholar 

  • Arockiaraj M, Abraham J, Quadras J, Shalini AJ (2015a) Linear layout of locally twisted cubes. Int J Comput Math 94:56–65. https://doi.org/10.1080/00207160.2015.1088943

    Article  MathSciNet  MATH  Google Scholar 

  • Arockiaraj M, Quadras J, Rajasingh I, Shalini AJ (2015b) Embedding hypercubes and folded hypercubes onto cartesian product of certain trees. Discrete Optim 17:1–13

    Article  MathSciNet  MATH  Google Scholar 

  • Arockiaraj M, Liu J-B, Shalini AJ (2019) Vertex decomposition methodfor wirelength problem and its applications to enhanced hypercube networks. IET Comput Digit Tec 13(2):87–92

    Article  Google Scholar 

  • Bezrukov SL, Chavez JD, Harper LH, Röttger M, Schroeder U-P (1998) Embedding of hypercubes into grids. In: Proceedings of the 23rd international symposium on mathematical foundations of computer science. Springer, pp 693–701

  • Bezrukov SL, Chavez JD, Harper LH, Röttger M, Schroeder U-P (2000a) The congestion of \(n\)-cube layout on a rectangular grid. Discrete Math 213(1):13–19

    Article  MathSciNet  MATH  Google Scholar 

  • Bezrukov SL, Das SK, Elsässer R (2000b) An edge-isoperimetric problem for powers of the Petersen graph. Ann Comb 4(2):153–169

    Article  MathSciNet  MATH  Google Scholar 

  • Boals AJ, Gupta AK, Sherwani NA (1994) Incomplete hypercubes: algorithms and embeddings. J Supercomput 8(3):263–294

    Article  Google Scholar 

  • Chen PPS (1976) The entity-relationship model-toward a unified view of data. ACM Trans Database Syst 1(1):9–36

    Article  MathSciNet  Google Scholar 

  • Chen H-L, Tzeng N-F (1997) A boolean expression-based approach for maximum incomplete subcube identification in faulty hypercubes. IEEE Trans Parallel Distrib Syst 8(11):1171–1183

    Article  Google Scholar 

  • Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press and McGraw-Hill, New York

    MATH  Google Scholar 

  • Diaz J, Petit J, Serna M (2002) A survey of graph layout problems. Comput Surv 34(3):313–56

    Article  Google Scholar 

  • Gane C, Sarson T (1977) Structured systems analysis: tools and techniques, 1st edn. McDonnell Douglas Systems Integration Company, Plano

    Google Scholar 

  • Harper LH (1964) Optimal assignments of numbers to vertices. SIAM J Appl Math 12(1):131–135

    Article  MathSciNet  MATH  Google Scholar 

  • Harper LH (2004) Global methods for combinatorial isoperimetric problems. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  • Karp RM (1993) Mapping the genome: some combinatorial problems arising in molecular biology. In: Proceedings of the twenty-fifth annual ACM symposium on theory of computing, New York, NY, USA, pp 278–285

  • Lai Y-L, Williams K (1999) A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs. J Graph Theory 31(2):75–94

    Article  MathSciNet  MATH  Google Scholar 

  • Loh PKK, Hsu WJ (1998) The Josephus cube: a large family of hypercubic interconnection networks. In: Proceedings of the 2nd international conference on parallel and distributed computing and networks, Brisbane, Australia, pp 176–181

  • Loh PKK, Hsu WJ (2000) The Josephus cube: a novel interconnection network. Parallel Comput 26(4):427–453

    Article  MathSciNet  MATH  Google Scholar 

  • Loh PKK, Hsu WJ (2003) Fault-tolerance of complete Josephus cubes. J Syst Archit 49(1):1–21

    Article  Google Scholar 

  • Loh PKK, Hsu WJ (2004) Fault-tolerant routing for complete Josephus cubes. Parallel Comput 30(9–10):1151–1167

    Article  Google Scholar 

  • Louri A, Sung H (1994) An optical multi-mesh hypercube: a scalable optical interconnection network for massively parallel computing. J Lightw Technol 12(4):70–716

    Article  Google Scholar 

  • Louri A, Weech B, Neocleous C (1998) A spanning multichannel linked hypercube: a gradually scalable optical interconnection network for massively parallel computing. IEEE Trans Parallel Distrib Syst 9(5):497–512

    Article  Google Scholar 

  • Lu L, Zhou S (2013) Conditional diagnosability of complete Josephus cubes. In: Network and parallel computing, lecture notes in computer science. Springer, Berlin, pp 220–231

    Google Scholar 

  • Manuel P (2011) Minimum average congestion of enhanced and augmented hypercubes into complete binary trees. Discrete Appl Math 159:360–366

    Article  MathSciNet  MATH  Google Scholar 

  • Manuel P, Rajasingh I, Rajan B, Mercy H (2009) Exact wirelength of hypercubes on a grid. Discrete Appl Math 157(7):1486–1495

    Article  MathSciNet  MATH  Google Scholar 

  • Manuel P, Arockiaraj M, Rajasingh I, Rajan B (2011) Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. Discrete Appl Math 159(17):2109–2116

    Article  MathSciNet  MATH  Google Scholar 

  • Mitchison G, Durbin R (1986) Optimal numberings of an \(n \times n\) array. SIAM J Discrete Math 7(4):571–582

    Article  MathSciNet  MATH  Google Scholar 

  • Pardo EG, Soto M, Thraves C (2015) Embedding signed graphs in the line. J Comb Optim 29(2):451–471

    Article  MathSciNet  MATH  Google Scholar 

  • Quadras J, Solomon SS (2015) Embedding of the folded hypercubes into tori. Math Comput Sci 9(2):177–183

    Article  MathSciNet  MATH  Google Scholar 

  • Rajasingh I, Arockiaraj M (2011) Linear wirelength of folded hypercubes. Math Comput Sci 5(1):101–111

    Article  MathSciNet  MATH  Google Scholar 

  • Rajasingh I, Arockiaraj M, Rajan B, Manuel P (2012a) Minimum wirelength of hypercubes into \(n\)-dimensional grid networks. Inf Process Lett 112(14–15):583–586

    Article  MathSciNet  MATH  Google Scholar 

  • Rajasingh I, Rajan B, Rajan RS (2012b) Embedding of hypercubes into necklace, windmill and snake graphs. Inf Process Lett 112:509–515

    Article  MathSciNet  MATH  Google Scholar 

  • Rajasingh I, Manuel P, Arockiaraj M, Rajan B (2013) Embedding of circulant networks. J Comb Optim 26(1):135–151

    Article  MathSciNet  MATH  Google Scholar 

  • Ravi R, Agrawal A, Klein P (1991) Ordering problems approximated: single-processor scheduling and interval graphs connection. In: Proceedings of the 18th international colloquium on automata. Languages and programming. Springer, New York, pp 751–762

  • Tzeng NF, Wei S (1991) Enhanced hypercubes. IEEE Trans Comput 40(3):284–294

    Article  Google Scholar 

  • Vannelli A, Rowan GS (1986) An eigen vector based approach for multistack VLSI layout. In: Proceedings of 29th midwest symposium on circuits and systems, North-Holland, New York, pp 435–439

Download references

Funding

This work was supported by Loyola College - Times of India, Chennai, India [Project No. 5LCTOI14MAT002].

Author information

Authors and Affiliations

  1. Department of Mathematics, Loyola College, Chennai, 600034, India

    Micheal Arockiaraj

  2. Department of Mathematics, KCG College of Technology, Chennai, 600097, India

    Jessie Abraham

  3. Department of Mathematics, Women’s Christian College, Chennai, 600006, India

    Arul Jeya Shalini

Authors
  1. Micheal Arockiaraj
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Jessie Abraham
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Arul Jeya Shalini
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Jessie Abraham.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Arockiaraj, M., Abraham, J. & Shalini, A.J. Node set optimization problem for complete Josephus cubes. J Comb Optim 38, 1180–1195 (2019). https://doi.org/10.1007/s10878-019-00443-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-019-00443-9

Keywords