Pricelists.org Pricelists.org Log in Sign up

Load Balancing in Parallel Computers

☆☆☆☆☆ (0 reviews)
Show price history
Load Balancing in Parallel Computers
Lowest price (incl. delivery)
32 918,00 JPY
Typical price2 578,34 PLN
Lowest (90 days)239,19 PLN
Offers5
Last updated1 week ago
See best offer
Price history (90 days)
Full history
2026-08-08 2026-08-15
Price History
Updated AtPrice
2026-08-08239,19
2026-08-15239,19
Seller Product price Delivery Total Availability Updated
SP SpringerNatureLink Shop INT 32 889,00 JPY 29,00 JPY 32 918,00 JPY Available 4 days ago View offer
SP Springer Nature Author 32 889,00 JPY 15,00 JPY 32 904,00 JPY Available 1 week ago View offer
SP SpringerNatureLink Shop INT 249,00 USD free 249,00 USD Available 4 days ago View offer
SP SpringerNatureLink Shop INT 249,00 USD 15,00 USD 264,00 USD Available 4 days ago View offer
SP SpringerNatureLink Shop INT 252,99 EUR 15,00 EUR 267,99 EUR Available 4 days ago View offer

Prices and availability may change. Last Updated: 08.08.2026 23:39.

EAN 9781475770667
Springer Nature
0,0
☆☆☆☆☆
0 reviews
5★ 0%
4★ 0%
3★ 0%
2★ 0%
1★ 0%

Product reviews

Rating
No reviews yet — be the first!
Load Balancing in Parallel Computers: Theory and Practice is about the essential software technique of load balancing in distributed memory message-passing parallel computers, also called multicomputers. Each processor has its own address space and has to communicate with other processors by message passing. In general, a direct, point-to-point interconnection network is used for the communications. Many commercial parallel computers are of this class, including the Intel Paragon, the Thinking Machine CM-5, and the IBM SP2. Load Balancing in Parallel Computers: Theory and Practice presents a comprehensive treatment of the subject using rigorous mathematical analyses and practical implementations. The focus is on nearest-neighbor load balancing methods in which every processor at every step is restricted to balancing its workload with its direct neighbours only. Nearest-neighbor methods are iterative in nature because a global balanced state can be reached through processors' successive local operations. Since nearest-neighbor methods have a relatively relaxed requirement for the spread of local load information across the system, they are flexible in terms of allowing one to control the balancing quality, effective for preserving communication locality, and can be easily scaled in parallel computers with a direct communication network. Load Balancing in Parallel Computers: Theory and Practice serves as an excellent reference source and may be used as a text for advanced courses on the subject.

Similar products