New answers tagged

2

There can be many reasons, but one example would be fairness. Suppose you have a modified version of ALOHA where one priority user has transmission probability set to 1 and all others to 0. Assuming the priority user always has a message to send, this scheme has a throughput of 1. However, this is an awful scheme if you care about any of the other users, ...


0

You understand the problem correctly; 1024 units are parallelizable. To calculate speedup, you can divide the serial runtime by the parallel runtime (no laws required). Or plug into the version of Amdahl's law that actually uses the number of processors (https://stackoverflow.com/a/37335032/5039395).


0

Your answer is probably correct for an exam. In reality, adding a pipeline stage to MIPS is a major undertaking. The MIPS pipeline is very simple, that’s why it is taught in CS courses. Adding a pipeline stage adds a whole new level of complexity. Take an instruction sequence X = A+B X = C+D Z = X+Y In the current pipeline design, Z can just about be ...


0

The problem in an exam is that you need the answer that is expected from you - something I’d have a real problem with. So keep this solution to yourself. Speed up is always hard to calculate - calculating execution time avoids lots of fractions and is equivalent. Assume your task would take one second on one processor X. Since S is serial, you need at ...


Top 50 recent answers are included