[Thunar-workers] [DokuWiki] page changed: infrastructure:related-links

[thunar-workers at xfce.org]

A page in your DokuWiki was added or changed. Here are the details:

Date        : 2005/02/19 18:42
Browser     : Mozilla/5.0 (X11; U; FreeBSD i386; en-US; rv:1.7.5) Gecko/20050122 Firefox/1.0
IP-Address  : 217.85.191.78
Hostname    : pD955BF4E.dip.t-dialin.net
Old Revision: http://thunar.xfce.org/wiki/infrastructure:related-links?rev=1108587733
New Revision: http://thunar.xfce.org/wiki/infrastructure:related-links
Edit Summary: 
User        : benny

@@ -31,4 +31,39 @@
  describes the basic ideas and goals of UML and the various
  diagram types used in software engineering.
  
  [[http://pigseye.kennesaw.edu/~dbraun/csis4650/A&D/UML_tutorial/]]
+ 
+ 
+ 
+ ===== Articles =====
+ 
+ 
+ ==== AlphaSort ====
+ This article describes AlphaSort, a highly optimized sort algorithm.
+ Especially interesting for Thunar is the optimization technique
+ described in this article: Take care that your code does not only
+ reduce disk access as much as possible, but equally important, make
+ sure that your code is //cache-sensitive//. Read the article, its
+ worth the download.
+ 
+ Abstract. //A new sort algorithm, called AlphaSort, demonstrates that
+ commodity processors and disks can handle commercial batch workloads.
+ Using commodity processors, memory, and arrays of SCSI disks, AlphaSort
+ runs the industry standard sort benchmark in seven seconds. This beats
+ the best published record on a 32-CPU 32-disk Hypercube by 8:1. On
+ another benchmark, AlphaSort sorted more than a gigabyte in one minute.
+ AlphaSort is a cache-sensitive, memory intensive sort algorithm. We
+ argue that modern architectures require algorithm designers to
+ re-examine their use of the memory hierarchy. AlphaSort uses clustered
+ data structures to get good cache locality, file striping to get high
+ disk bandwidth, QuickSort to generate runs, and replacement-selection
+ to merge the runs. It uses shared memory multiprocessors to break the
+ sort into subsort chores. Because startup times are becoming a
+ significant part of the total time, we propose two new benchmarks:
+ (1) MinuteSort: how much can you sort in one minute, and (2)
+ PennySort: how much can you sort for one penny.//
+ 
+ [[http://home.unix-ag.org/bmeurer/files/AlphaSort.pdf]]
+ 
+ 
+ 



-- 
This mail was generated by DokuWiki at
http://thunar.xfce.org/wiki/