Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emerging OWL ontologies from the web community consisting of up to hundreds of thousand of named classes and the increasing availability of multi-processor and multi- or manycore computers, we extend the work on parallel TBox classification and propose a new algorithm that is sound and complete and demonstrates in a first experimental evaluation a low overhead in the number of subsumption tests due to parallel execution. 1 Motivation Due to the recent popularity of OWL ontologies in the web one can observe a trend toward the development of very large or huge OWL-DL ontologies. For instance, well known examples from the bioinformatics or medical community are UMLS, GALEN or even ontologies with more concepts. Some (versions) of the ontologies consist of more than hundreds of thousands of named concepts/classes and...