Skip to main content
SpringerLink
Log in
Book cover

Advanced Boolean Techniques pp 159–175Cite as

Literal Selection in Switching Lattice Design

  • Chapter
  • First Online:

Abstract

Switching lattices are two-dimensional arrays of four-terminal switches proposed in a seminal paper by Akers in 1972 to implement Boolean functions. Recently, with the advent of a variety of emerging nanoscale technologies based on regular arrays of switches, synthesis methods targeting lattices of multi-terminal switches have found a renewed interest. In this paper we discuss two different combinatorial problems related to the assignment of input literals to switches in a lattice when multiple choices are possible at some switch. We propose and develop efficient heuristic algorithms for both problems and discuss the implication of the different solutions on the layout of switching lattices. Experimental results on a set of known benchmarks confirm the effectiveness of the proposed heuristics.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    The dual of a Boolean function f of n binary variables is the function f D such that \(f(x_1,x_2,\ldots , x_n) = \overline {f^D} (\overline x_1, \overline x_2, \ldots , \overline x_n)\).

  2. 2.

    The makespan of a schedule is the difference in time between its start and its end. With unit-length jobs, as we assume below, makespan represents the maximum number of jobs assigned to a machine.

References

  1. Akers, S.B.: A rectangular logic array. IEEE Trans. Comput. 21(8), 848–857 (1972)

    Article  Google Scholar 

  2. Alexandrescu, D., Altun, M., Anghel, L., Bernasconi, A., Ciriani, V., Frontini, L., Tahoori, M.B.: Logic synthesis and testing techniques for switching nano-crossbar arrays. Microprocess. Microsyst. Embed. Hardw. Des. 54, 14–25 (2017)

    Article  Google Scholar 

  3. Altun, M., Riedel, M.D.: Lattice-based computation of Boolean functions. In: Proceedings of the 47th Design Automation Conference, DAC 2010, Anaheim, CA, July 13–18, pp. 609–612 (2010)

    Google Scholar 

  4. Altun, M., Riedel, M.D.: Logic synthesis for switching lattices. IEEE Trans. Comput. 61(11), 1588–1600 (2012)

    Article  MathSciNet  Google Scholar 

  5. Altun, M., Ciriani, V., Tahoori, M.B.: Computing with nano-crossbar arrays: logic synthesis and fault tolerance. In: Design, Automation & Test in Europe Conference & Exhibition, DATE 2017, Lausanne, March 27–31, 2017, pp. 278–281 (2017)

    Google Scholar 

  6. Asahiro, Y., Miyano, E., Ono, H., Zenmyo, K.: Graph orientation algorithms to minimize the maximum outdegree. Int. J. Found. Comput. Sci. 18(2) 197–215 (2010)

    Article  MathSciNet  Google Scholar 

  7. Barbuti, R., Gori, R., Milazzo, P.: Multiset patterns and their application to dynamic causalities in membrane systems. In: Membrane Computing - 18th International Conference, CMC 2017, Bradford, July 25–28, 2017. Revised Selected Papers, pp. 54–73

    Google Scholar 

  8. Barbuti, R., Bernasconi, A., Gori, R., Milazzo, P.: Computing preimages and ancestors in reaction systems. In: Theory and Practice of Natural Computing - 7th International Conference, TPNC 2018, Dublin, December 12–14, 2018, Proceedings, pp. 23–35

    Chapter  Google Scholar 

  9. Barbuti, R., Gori, R., Milazzo, P.: Predictors for flat membrane systems. Theor. Comput. Sci. 736, 79–102 (2018)

    Article  MathSciNet  Google Scholar 

  10. Bernasconi, A., Ciriani, V.: DRedSOP: synthesis of a new class of regular functions. In: Euromicro Conference on Digital Systems Design (DSD), pp. 377–384 (2006)

    Google Scholar 

  11. Bernasconi, A., Ciriani, V.: Logic synthesis and testability of d-reducible functions. In: VLSI-SoC, pp. 280–285 (2010)

    Google Scholar 

  12. Bernasconi, A., Ciriani, V.: Dimension-reducible Boolean functions based on affine spaces. ACM Trans. Des. Autom. Electron. Syst. 16(2), 13 (2011)

    Article  Google Scholar 

  13. Bernasconi, A., Ciriani, V., Luccio, F., Pagli, L.: Exploiting regularities for Boolean function synthesis. Theory Comput. Syst. 39(4), 485–501 (2006)

    Article  MathSciNet  Google Scholar 

  14. Bernasconi, A., Ciriani, V., Luccio, F., Pagli, L.: Synthesis of autosymmetric functions in a new three-level form. Theory Comput. Syst. 42(4), 450–464 (2008)

    Article  MathSciNet  Google Scholar 

  15. Bernasconi, A., Ciriani, V., Trucco, G., Villa, T.: Logic synthesis by signal-driven decomposition. In: Gulati, K. (ed.) Advanced Techniques in Logic Synthesis, Optimizations and Applications, pp. 9–29. Springer, New York (2011)

    Chapter  Google Scholar 

  16. Bernasconi, A., Ciriani, V., Liberali, V., Trucco, G., Villa, T.: Synthesis of p-circuits for logic restructuring. Integration 45(3), 282–293 (2012)

    Article  Google Scholar 

  17. Bernasconi, A., Ciriani, V., Trucco, G., Villa, T.: Using flexibility in P-circuits by Boolean relations. IEEE Trans. Comput. 64(12), 3605–3618 (2015)

    Article  MathSciNet  Google Scholar 

  18. Bernasconi, A., Ciriani, V., Frontini, L., Liberali, V., Trucco, G., Villa, T.: Logic synthesis for switching lattices by decomposition with p-circuits. In: 2016 Euromicro Conference on Digital System Design, DSD 2016, Limassol, August 31–September 2, 2016, pp. 423–430

    Google Scholar 

  19. Bernasconi, A., Ciriani, V., Frontini, L., Trucco, G.: Synthesis on switching lattices of dimension-reducible Boolean functions. In: IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC) (2016)

    Google Scholar 

  20. Bernasconi, A., Ciriani, V., Frontini, L., Trucco, G.: Composition of switching lattices and autosymmetric Boolean function synthesis. In: Euromicro Conference on Digital System Design, DSD 2017, Vienna, August 30–September 1, 2017, pp. 137–144

    Google Scholar 

  21. Bernasconi, A., Boffa, A., Luccio, F., Pagli, L.: Two combinatorial problems on the layout of switching lattices. In: IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC) (2018)

    Google Scholar 

  22. Bernasconi, A., Ciriani, V., Frontini, L.: Testability of switching lattices in the stuck at fault model. In: IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC) (2018)

    Google Scholar 

  23. Bernasconi, A., Ciriani, V., Frontini, L., Liberali, V., Trucco, G., Villa, T.: Enhancing logic synthesis of switching lattices by generalized Shannon decomposition methods. Microprocess. Microsyst. Embed. Hardw. Des. 56, 193–203 (2018)

    Article  Google Scholar 

  24. Bernasconi, A., Ciriani, V., Frontini, L., Trucco, G.: Composition of switching lattices for regular and for decomposed functions. Microprocess. Microsyst. Embed. Hardw. Des. 60, 207–218 (2018)

    Article  Google Scholar 

  25. Cheng, T.C.E., Sin, C.C.S.: A state-of-the-art review of parallel machine scheduling research. Eur. J. Oper. Res. (47), 271–292 (1990)

    Article  Google Scholar 

  26. Gange, G., Søndergaard, H., Stuckey, P.J.: Synthesizing optimal switching lattices. ACM Trans. Des. Autom. Electron. Syst. 20(1), 6:1–6:14 (2014)

    Article  Google Scholar 

  27. Harvey, N.J., Ladner, R.E., Lovász, L., Tamir, T.: Semi-matchings for bipartite graphs and load balancing. J. Algorithm. 59(1), 53–78 (2006)

    Article  MathSciNet  Google Scholar 

  28. Lin, Y., Li, W.: Parallel machine scheduling of machine-dependent jobs with unit-length. Eur. J. Oper. Res. 156(1), 261–266 (2004)

    Article  MathSciNet  Google Scholar 

  29. Luccio, F., Xia, M.: The MPA graph problem. Department of Informatics, University of Pisa. Technical Report (2018)

    Google Scholar 

  30. Mokotoff, E.: Parallel machine scheduling problems: a survey. Asia-Pacific J. Oper. Res. 18(2), 193–242 (2001)

    MathSciNet  MATH  Google Scholar 

  31. Morgul, M.C., Altun, M.: Synthesis and optimization of switching nanoarrays. In: 2015 IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS), pp. 161–164. IEEE, Piscataway (2015)

    Google Scholar 

  32. Tunali, O., Altun, M.: Permanent and transient fault tolerance for reconfigurable nano-crossbar arrays. IEEE Trans. CAD Integr. Circuits Syst. 36(5), 747–760 (2017)

    Article  Google Scholar 

  33. Tunali, O., Altun, M.: A survey of fault-tolerance algorithms for reconfigurable nano-crossbar arrays. ACM Comput. Surv. 50(6), 79:1–79:35 (2017)

    Article  Google Scholar 

  34. Tunali, O., Altun, M.: Logic synthesis and defect tolerance for memristive crossbar arrays. In: 2018 Design, Automation & Test in Europe Conference & Exhibition, DATE 2018, Dresden, March 19–23, 2018, pp. 425–430

    Google Scholar 

  35. Yang, S.: Logic Synthesis and Optimization Benchmarks User Guide Version 3.0. User Guide, Microelectronic Center (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Pisa, Italy

    Anna Bernasconi, Fabrizio Luccio, Linda Pagli & Davide Rucci

Authors
  1. Anna Bernasconi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabrizio Luccio
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Linda Pagli
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Davide Rucci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anna Bernasconi .

Editor information

Editors and Affiliations

  1. Arbeitsgruppe Rechnerarchitektur, Universität Bremen, Bremen, Germany

    Rolf Drechsler

  2. École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland

    Mathias Soeken

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bernasconi, A., Luccio, F., Pagli, L., Rucci, D. (2020). Literal Selection in Switching Lattice Design. In: Drechsler, R., Soeken, M. (eds) Advanced Boolean Techniques. Springer, Cham. https://doi.org/10.1007/978-3-030-20323-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-20323-8_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-20322-1

  • Online ISBN: 978-3-030-20323-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation