e(ho0n3 Posted July 25, 2004 Posted July 25, 2004 I was reading through my parallel comp. book when I came across this sentence: If the bisection bandwidth of a network is w, the lower bound on the area in a two-dimensial packaging is Θ(w2), and the lower bound on the volume in a three-dimensional packaging is Θ(w3/2). This is where I stopped since I have no idea how and where they got these lower bounds from. Anybody here familiar with this? Maybe I should just stop reading this weird book.
Dave Posted July 25, 2004 Posted July 25, 2004 I have absolutely no clue, and I'd go with the "not reading" option
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now