Pricelists.org Pricelists.org 로그인 가입하기

Load Balancing in Parallel Computers

☆☆☆☆☆ (0 reviews)
Show price history
Load Balancing in Parallel Computers
Lowest price (incl. delivery)
179,49 USD
Typical price3 859,06 PLN
Lowest (90 days)160,49 PLN
Offers8
Last updated6일 전
See best offer
Price history (90 days)
Full history
2026-08-08 2026-08-15
가격 이력
업데이트 일시가격
2026-08-08160,49
2026-08-15199,99
판매자 Product price Delivery 합계 재고 여부 Updated
SP SpringerNatureLink Shop INT 160,49 USD 19,00 USD 179,49 USD 구매 가능 1시간 전 View offer
SP Springer Nature Author 160,49 EUR 15,00 EUR 175,49 EUR 구매 가능 6일 전 View offer
SP Springer Nature Author 28 599,00 JPY 29,00 JPY 28 628,00 JPY 구매 가능 6일 전 View offer
SP SpringerNatureLink Shop INT 219,00 USD 29,00 USD 248,00 USD 구매 가능 42분 전 View offer
SP SpringerNatureLink Shop INT 219,00 USD 15,00 USD 234,00 USD 구매 가능 42분 전 View offer
SP SpringerNatureLink Shop INT 229,99 USD 25,00 USD 254,99 USD 구매 가능 34분 전 View offer
SP SpringerNatureLink Shop INT 229,99 USD 19,00 USD 248,99 USD 구매 가능 34분 전 View offer
SP SpringerNatureLink Shop INT 236,00 EUR free 236,00 EUR 구매 가능 31분 전 View offer

가격과 재고 여부는 변경될 수 있습니다. 마지막 업데이트: 08.08.2026 23:35.

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