Francis C.M. Lau – författare
Visar alla böcker från författaren Francis C.M. Lau. Handla med fri frakt och snabb leverans.
11 produkter
11 produkter
E-bok
PDF, Engelska, 20072 860 kr
Läs direkt efter köp
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.
Del 381 - Springer International Series in Engineering and Computer Science
Load Balancing in Parallel Computers
Theory and Practice
Inbunden, Engelska, 1996
2 219 kr
Skickas inom 10-15 vardagar
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.
Del 381 - Springer International Series in Engineering and Computer Science
Load Balancing in Parallel Computers
Theory and Practice
Häftad, Engelska, 2013
2 548 kr
Skickas inom 10-15 vardagar
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.
Inbunden, Engelska, 2003
1 616 kr
Skickas inom 10-15 vardagar
In the 1970's and 1980's, we saw phenomenal advancement in nonlinear sci ence, which had led to many important discoveries that greatly improve our understanding of the physical world. Among them, the discovery of chaos in deterministic systems is unarguably one of the most revolutionary scientific findings. We are now able to explain the apparent complexity and subtle or der exhibited by many physical systems under the unified framework of chaos theory. The past decade has seen heightened interest in the exploitation of chaos for useful applications in engineering systems. One application area that has attracted a great deal of attention is communications. Chaotic signals, by virtue of their wide band characteristic, are natural candidates for carrying information in a spread-spectrum communication environment. The use of chaotic signals in communications thus naturally inherits the advantages that are currently being offered by conventional spread-spectrum communication systems, such as robustness in multi path environments, resistance to jam ming, low probability of interception, etc. In addition, chaotic signals are easy to generate and hence offer a potentially low-cost solution to spread spectrum communications. Although many practical problems need to be solved before chaos-based communications can be realized in practice, the field has advanced rapidly during the past few years and it now reaches a point where abstract concepts from physics and mathematics have been fruitfully ported to techniques that allow information to be carried by chaotic signals.
Inbunden, Engelska, 2009
1 664 kr
Skickas inom 10-15 vardagar
"A Computational Approach to Digital Chinese Painting and Calligraphy" is a technical book on computer science and its applications in the arts. It focuses on Oriental digital arts, in particular Chinese arts and painting, offering a multi-disciplinary treatment from the angles of computer graphics, interactive techniques, human-computer interaction, and artificial intelligence. The book also discusses the unique difficulties and challenges of using the computer to produce Oriental arts, including research results by the authors and their lessons and engineering experiences behind these efforts. Songhua Xu is a computer scientist of Zhejiang University and Yale University, as well as an honorary researcher of the University of Hong Kong. Francis C.M. Lau is Professor at the University of Hong Kong where he leads the Systems Research Group in the Department of Computer Science. Yunhe Pan is Professor of Computer Science at Zhejiang University as well as Deputy President of Chinese Academy of Engineering.
E-bok
PDF, Engelska, 20092 110 kr
Läs direkt efter köp
"A Computational Approach to Digital Chinese Painting and Calligraphy" is a technical book on computer science and its applications in the arts. It focuses on Oriental digital arts, in particular Chinese arts and painting, offering a multi-disciplinary treatment from the angles of computer graphics, interactive techniques, human-computer interaction, and artificial intelligence. The book also discusses the unique difficulties and challenges of using the computer to produce Oriental arts, including research results by the authors and their lessons and engineering experiences behind these efforts.
Songhua Xu is a computer scientist of Zhejiang University and Yale University, as well as an honorary researcher of the University of Hong Kong. Francis C.M. Lau is Professor at the University of Hong Kong where he leads the Systems Research Group in the Department of Computer Science. Yunhe Pan is Professor of Computer Science at Zhejiang University as well as Deputy President of Chinese Academy of Engineering.
Häftad, Engelska, 2011
1 616 kr
Skickas inom 10-15 vardagar
In the 1970's and 1980's, we saw phenomenal advancement in nonlinear sci ence, which had led to many important discoveries that greatly improve our understanding of the physical world. Among them, the discovery of chaos in deterministic systems is unarguably one of the most revolutionary scientific findings. We are now able to explain the apparent complexity and subtle or der exhibited by many physical systems under the unified framework of chaos theory. The past decade has seen heightened interest in the exploitation of chaos for useful applications in engineering systems. One application area that has attracted a great deal of attention is communications. Chaotic signals, by virtue of their wide band characteristic, are natural candidates for carrying information in a spread-spectrum communication environment. The use of chaotic signals in communications thus naturally inherits the advantages that are currently being offered by conventional spread-spectrum communication systems, such as robustness in multi path environments, resistance to jam ming, low probability of interception, etc. In addition, chaotic signals are easy to generate and hence offer a potentially low-cost solution to spread spectrum communications. Although many practical problems need to be solved before chaos-based communications can be realized in practice, the field has advanced rapidly during the past few years and it now reaches a point where abstract concepts from physics and mathematics have been fruitfully ported to techniques that allow information to be carried by chaotic signals.
E-bok
PDF, Engelska, 20131 977 kr
Läs direkt efter köp
In the 1970''s and 1980''s, we saw phenomenal advancement in nonlinear sci ence, which had led to many important discoveries that greatly improve our understanding of the physical world. Among them, the discovery of chaos in deterministic systems is unarguably one of the most revolutionary scientific findings. We are now able to explain the apparent complexity and subtle or der exhibited by many physical systems under the unified framework of chaos theory. The past decade has seen heightened interest in the exploitation of chaos for useful applications in engineering systems. One application area that has attracted a great deal of attention is communications. Chaotic signals, by virtue of their wide band characteristic, are natural candidates for carrying information in a spread-spectrum communication environment. The use of chaotic signals in communications thus naturally inherits the advantages that are currently being offered by conventional spread-spectrum communication systems, such as robustness in multi path environments, resistance to jam ming, low probability of interception, etc. In addition, chaotic signals are easy to generate and hence offer a potentially low-cost solution to spread spectrum communications. Although many practical problems need to be solved before chaos-based communications can be realized in practice, the field has advanced rapidly during the past few years and it now reaches a point where abstract concepts from physics and mathematics have been fruitfully ported to techniques that allow information to be carried by chaotic signals.
Inbunden, Engelska, 2017
1 553 kr
Skickas inom 10-15 vardagar
This book introduces novel solutions to the rendezvous problem in distributed systems, a fundamental problem that underpins the construction of many important functions in distributed systems and networks. The book covers rendezvous theories, distributed rendezvous algorithms, and rendezvous applications in practical systems, presents state-of-the-art rendezvous results and highlights the latest methods of rendezvous in distributed systems. It provides in particular an in-depth treatment of the blind rendezvous and oblivious blind rendezvous problems and their solutions. Further, it sheds new light on rendezvous applications in cognitive radio networks and rendezvous search in graphs. As such, it will also be of interest to readers from other research fields such as robotics, wireless sensor networks, and game theory.
E-bok
Engelska, 20171 416 kr
Läs direkt efter köp
This book introduces novel solutions to the rendezvous problem in distributed systems, a fundamental problem that underpins the construction of many important functions in distributed systems and networks. The book covers rendezvous theories, distributed rendezvous algorithms, and rendezvous applications in practical systems, presents state-of-the-art rendezvous results and highlights the latest methods of rendezvous in distributed systems. It provides in particular an in-depth treatment of the blind rendezvous and oblivious blind rendezvous problems and their solutions. Further, it sheds new light on rendezvous applications in cognitive radio networks and rendezvous search in graphs. As such, it will also be of interest to readers from other research fields such as robotics, wireless sensor networks, and game theory.
Häftad, Engelska, 2018
1 079 kr
Skickas inom 10-15 vardagar
This book introduces novel solutions to the rendezvous problem in distributed systems, a fundamental problem that underpins the construction of many important functions in distributed systems and networks. The book covers rendezvous theories, distributed rendezvous algorithms, and rendezvous applications in practical systems, presents state-of-the-art rendezvous results and highlights the latest methods of rendezvous in distributed systems. It provides in particular an in-depth treatment of the blind rendezvous and oblivious blind rendezvous problems and their solutions. Further, it sheds new light on rendezvous applications in cognitive radio networks and rendezvous search in graphs. As such, it will also be of interest to readers from other research fields such as robotics, wireless sensor networks, and game theory.