## Invitation to Computer Science 8th Edition

One solution would be to have the $input$/$output$ processor set a timer for the maximum possible response time from each of the search processors and if that time is exceeded, it reports that NUMBER was not found. This is not foolproof, because it could simply be that the communications link between the $input$/$output$ processor and the one processor that found NUMBER is broken, so it was unable to report back the corresponding NAME. A better solution would be to have each search processor report back to the $input$/$output$ processor when it cannot find NUMBER; when the $input$/$output$ processor has received that message from all $1,000$ search processors, it would then report that NUMBER was not found.
One solution would be to have the $input$/$output$ processor set a timer for the maximum possible response time from each of the search processors and if that time is exceeded, it reports that NUMBER was not found. This is not foolproof, because it could simply be that the communications link between the $input$/$output$ processor and the one processor that found NUMBER is broken, so it was unable to report back the corresponding NAME. A better solution would be to have each search processor report back to the $input$/$output$ processor when it cannot find NUMBER; when the $input$/$output$ processor has received that message from all $1,000$ search processors, it would then report that NUMBER was not found.