@conference {14762,
	title = {Benchmarking a network of PCs running parallel applications},
	booktitle = {Performance, Computing and Communications, 1998. IPCCC {\textquoteright}98., IEEE International},
	year = {1998},
	month = {1998/02/16/18},
	pages = {1 - 7},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Presents a benchmarking study that compares the performance of a network of four PCs connected by a 100 Mbit/s fast Ethernet running three different system software configurations: TCP/IP on Windows NT, TCP/IP on Linux and a lightweight message-passing protocol (U-Net active messages) on Linux. For each configuration, we report results for communication micro-benchmarks and the NAS (Numerical Aerodynamics Simulation) parallel benchmarks. For the NAS benchmarks, the overall running time using Linux TCP/IP was 12-500\% less than the Windows NT TCP/IP configuration. Likewise, the Linux U-Net based message-passing protocol outperformed the Linux TCP/IP version by 5-200\%+. We also show that, by using Linux U-Net, we are able to achieve 125 μs latency between two processes using PVM. Finally, we report that the default mathematical libraries supplied with NT (for both gcc and Visual C++) are substantially slower than the one supplied with Linux},
	keywords = {100 Mbit/s, 125 mus, Aerodynamics, Application software, communication micro-benchmarks, default mathematical libraries, Delay, Ethernet, Ethernet networks, gcc, latency, lightweight message-passing protocol, Linux, Local area networks, mathematics computing, Message passing, microcomputer applications, Microsoft Windows NT, NAS parallel benchmarks, network operating systems, Numerical simulation, parallel applications, PARALLEL PROCESSING, PC network benchmarking, performance comparison, performance evaluation, Personal communication networks, Protocols, PVM, running time, software libraries, System software, system software configurations, TCP/IP, TCPIP, Transport protocols, U-Net active messages, Visual C++},
	isbn = {0-7803-4468-5},
	doi = {10.1109/PCCC.1998.659876},
	author = {Hollingsworth, Jeffrey K and Guven, E. and Akinlar, C.}
}
@conference {18145,
	title = {Towards a theory of nearly constant time parallel algorithms},
	booktitle = {Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on},
	year = {1991},
	month = {1991/10//},
	pages = {698 - 710},
	abstract = {It is demonstrated that randomization is an extremely powerful tool for designing very fast and efficient parallel algorithms. Specifically, a running time of <e1>O</e1>(lg* <e1>n</e1>) (nearly-constant), with high probability, is achieved using <e1>n</e1>/lg* <e1>n</e1> (optimal speedup) processors for a wide range of fundamental problems. Also given is a constant time algorithm which, using <e1>n</e1> processors, approximates the sum of <e1>n</e1> positive numbers to within an error which is smaller than the sum by an order of magnitude. A variety of known and new techniques are used. New techniques, which are of independent interest, include estimation of the size of a set in constant time for several settings, and ways for deriving superfast optimal algorithms from superfast nonoptimal ones},
	keywords = {computational complexity, Estimation, nearly constant time parallel algorithms, Parallel algorithms, positive numbers, randomization, running time, superfast optimal algorithms},
	doi = {10.1109/SFCS.1991.185438},
	author = {Gil,J. and Matias,Y. and Vishkin, Uzi}
}
