[
    {
        "id": "authors:y87an-p8258",
        "collection": "authors",
        "collection_id": "y87an-p8258",
        "cite_using_url": "https://resolver.caltech.edu/CaltechCSTR:3760-tr-80",
        "type": "monograph",
        "title": "The Tree Machine: A Highly Concurrent Computing Environment",
        "author": [
            {
                "family_name": "Browning",
                "given_name": "Sally A.",
                "clpid": "Browning-Sally-Anne"
            }
        ],
        "abstract": "An architecture for a VLSI multiprocessor machine is proposed. The processors are connected together as a binary tree. A collection of algorithms are mapped onto the tree machine. These include heap sort, transitive closure, the travelling salesman, and matrix inversion, among others. A model of computational complexity for the tree machine is suggested, and the algorithms are analyzed in the context of that model. A notation for expressing the algorithms is described, a processor design is proposed, and a compiler for the notation and processor is presented.",
        "doi": "10.7907/Z96W9816",
        "publisher": "California Institute of Technology",
        "publication_date": "1980-01-01"
    }
]