Answered

Welcome to Westonci.ca, your go-to destination for finding answers to all your questions. Join our expert community today! Discover the answers you need from a community of experts ready to help you with their knowledge and experience in various fields. Connect with a community of professionals ready to help you find accurate solutions to your questions quickly and efficiently.

Consider a multilevel computer in which all levels are different. Each level has instructions that are m times as powerful as those of the level below it; that is, one level r instructions that are m times as powerful as those of the level below it; that is, one level r instruction can do the work of m level r-1 instructions. If a level-1 program requires k seconds to run, how long would equivalent programs take at levels 2, 3, and 4, assuming n level r instrucions are required to interpret a single r+1 instruction?

Sagot :

Answer:

Following are the responses to the given question:

Explanation:

Its machine slows for each further level of evaluation by an n/m factor. Therefore are the times for implementation for levels 2, 3, and 4 are [tex]\frac{kn}{m} \ and\ \frac{kn^2}{m^2} \ and \ \frac{kn^3}{m^3}[/tex].

So, the level values are:

[tex]level \ 2 = \frac{kn}{m}\\\\level \ 3 = \frac{kn^2}{m^2}\\\\level \ 4 = \frac{kn^2}{m^2}\\\\[/tex]

Thank you for your visit. We're dedicated to helping you find the information you need, whenever you need it. Thank you for your visit. We're dedicated to helping you find the information you need, whenever you need it. Thank you for trusting Westonci.ca. Don't forget to revisit us for more accurate and insightful answers.