From benson_muite at emailplus.org Mon May 3 06:53:32 2021 From: benson_muite at emailplus.org (Benson Muite) Date: Mon, 3 May 2021 09:53:32 +0300 Subject: [Beowulf] Ethernet switch OSes In-Reply-To: <20210423040730.GA22794@rd.bx9.net> References: <20210423040730.GA22794@rd.bx9.net> Message-ID: <9071ed2d-e3d3-1e0b-d011-7a221e54c1fe@emailplus.org> On 4/23/21 7:07 AM, Greg Lindahl wrote: > I'm buying a 100 gig ethernet switch for my lab, and it seems that the > latest gear is intended to run a switch OS. Being as cheap as I've > always been, free software sounds good. > > It looks like Open Network Linux is kaput. > > It looks like SONiC is doing pretty well. There is an OpenCompute HPC group. May wish to indicate your future networking requirements to help shape purchase possibilities: https://www.opencompute.org/wiki/HPC > > And there are several commercial offerings. > > Does anyone have experience with these OSes? Initially I'm going to > just have a single 32-port switch here and there, but I may have to > build much larger systems in the 6-12 month timeframe. > > Thanks in advance! > > -- greg > > p.s. I've left Silicon Valley and I'm working at the Event Horizon > Telescope, those people with the image of the ring around the black > hole. I'll be attending Supercomputing again! Surely there will be a > Beowulf Bash! > > p.p.s. and if any vendor wants to *sell* me aforesaid switch, please > send me a direct email. After 24 years of not having to get 3 quotes > for smallish purchases, my purchasing department is driving me nuts. > > > _______________________________________________ > Beowulf mailing list, Beowulf at beowulf.org sponsored by Penguin Computing > To change your subscription (digest mode or unsubscribe) visit https://beowulf.org/cgi-bin/mailman/listinfo/beowulf > From engwalljonathanthereal at gmail.com Tue May 4 19:53:42 2021 From: engwalljonathanthereal at gmail.com (Jonathan Engwall) Date: Tue, 4 May 2021 12:53:42 -0700 Subject: [Beowulf] A quick ML investigation Message-ID: Hello Beowulf, After this brief OCaml video https://youtu.be/a3kVJKt9mq4 I created a larger data set one with 5,000 of 10,000 numbers sequenced randomly. It illuminates the workings of RED BLACK binary tree. Simply copy&paste (ctrl k ctrl v) the large set to the command line. OCaml immediately builds several BLACK root nodes searching for a "balance point." I give a link to the RED BLACK implementation and larger data set. My source receives credit as well. Earlier experience with simple routines like fibonacci have me worried that OCaml is slow, RED BLACK's all short branches look quite fast. Jonathan Engwall -------------- next part -------------- An HTML attachment was scrubbed... URL: From engwalljonathanthereal at gmail.com Thu May 6 02:11:02 2021 From: engwalljonathanthereal at gmail.com (Jonathan Engwall) Date: Wed, 5 May 2021 19:11:02 -0700 Subject: [Beowulf] A quick ML investigation In-Reply-To: References: Message-ID: More exciting (if ML is your thing) news: when I reinstituted the call for mem x, let rec mem x = function Leaf -> false | Node (_, y, left, right) -> x = y || (x < y && mem x left) || (x > y && mem x right) ;; emptied the tree, re-loaded the 5,000 or so of 10,000 unsorted numbers I got this: # mem 7178 s;; - : bool = true # mem 285 s;; - : bool = true # mem 6009 s;; - : bool = true # mem 6008 s;; - : bool = false 6008 is in the chopped out section of the original 10,000. OCaml reads this list of int's in the blink of an eye; the entire list! Jonathan Engwall On Tue, May 4, 2021 at 12:53 PM Jonathan Engwall < engwalljonathanthereal at gmail.com> wrote: > Hello Beowulf, > After this brief OCaml video https://youtu.be/a3kVJKt9mq4 I created a > larger data set one with 5,000 of 10,000 numbers sequenced randomly. It > illuminates the workings of RED BLACK binary tree. > > Simply copy&paste (ctrl k ctrl v) the large set to the command line. OCaml > immediately builds several BLACK root nodes searching for a "balance point." > I give a link to the RED BLACK implementation and larger data set. My > source receives credit as well. > > Earlier experience with simple routines like fibonacci have me worried > that OCaml is slow, RED BLACK's all short branches look quite fast. > > Jonathan Engwall > -------------- next part -------------- An HTML attachment was scrubbed... URL: