A protocol-adaptive monitoring tree for efficient design of traffic monitoring probes
Computer Networks: The International Journal of Computer and Telecommunications Networking
A parallel backtracking framework (BkFr) for single and multiple clusters
Proceedings of the 1st conference on Computing frontiers
Improving Performance of Virtual Reality Applications Through Parallel Processing
The Journal of Supercomputing
Computational concepts in IT: a new approach to IT mathematics
Proceedings of the 6th conference on Information technology education
Adaptive expression based routing protocol for P2P systems
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
| Hi-index | 0.00 |
From the Publisher:Reflecting the increasing importance of parallel algorithms and parallel computer architectures, FUNDAMENTALS OF SEQUENTIAL AND PARALLEL ALGORITHMS provides in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid foundation in the theory of parallel algorithms. Professors Berman and Paul give students a comprehensive tool kit of sequential and parallel algorithms, plus a set of mathematical techniques for assessing the performance and correctness of algorithms. Their balanced, integrated presentation of sequential and parallel algorithms helps students gain a more intuitive ability to select appropriate algorithms from a variety of alternatives. The authors determine worst, best, and average running times for the algorithms covered. For both Parallel Random Access Machines and interconnection network models, they present algorithms in parallel pseudocode.