A parallel architecture model for the management of an image database

A parallel architecture is described for the management of an image database. One of the most usual processing is studied, it is distributed among the processors. In order to get the response time, a model of the system is made. An approximate solution is given: a fork-join with p processors and n arrivals (where n is different from p) is approximated by the join of the response times of a multiservor queue with bulk arrivals. This method is of general use.