New pages
- 14:34, 17 May 2012 Getting MRNetLIBI4.0 to build (hist) [1,909 bytes] TaylorGroves (Talk | contribs) (Created page with "=The libxplat.a.4.0.0 issue= <code><pre> Archiving libxplat.a.4.0.0 ... /bin/sh: /home/h4u5/workspace/mrnet_libi_4.0.0/build/x86_64-unknown-linux-gnu/lib/libxplat.a.4.0.0: not...")
- 15:08, 22 April 2012 MRNet LIBI Network.h (hist) [254 bytes] TaylorGroves (Talk | contribs) (Created page with "Really the only changes that I've had to make so far was to add some friend classes. This was needed since I used the RSH files as the originals for the LIBI files. *friend ...")
- 15:06, 22 April 2012 MRNet LIBI LIBIParentNode.C (hist) [263 bytes] TaylorGroves (Talk | contribs) (Created page with "=New Functions= ==set_numChildrenExpected== This function wasn't in the original MRNet ParentNode.C. So, I'm assuming it was something Josh added. In an effort to keep change...")
- 10:14, 10 April 2012 LIBIXTNetwork.C (hist) [683 bytes] TaylorGroves (Talk | contribs) (Created page with "=LIBIXTNetwork.C= ===CreateNetworkFE=== ====Called By==== User application ====Calls==== *Network::init_FrontEnd ---- ===CreateFrontEndNode (virtual)=== ====Called By==== i...")
- 10:14, 10 April 2012 LIBIRSHNetwork.C (hist) [683 bytes] TaylorGroves (Talk | contribs) (Created page with "=LIBIXTNetwork.C= ===CreateNetworkFE=== ====Called By==== User application ====Calls==== *Network::init_FrontEnd ---- ===CreateFrontEndNode (virtual)=== ====Called By==== i...")
- 10:12, 10 April 2012 LIBINetwork.C (hist) [3,181 bytes] TaylorGroves (Talk | contribs) (Created page with "=LIBINetwork.C= ==Functions== ===Instantiate (virtual)=== Instantiate is a virtual function fulfilled by the RSH and XT Network.C files within the non-LIBI mrnet. Given a pars...")
- 14:57, 4 April 2012 Stage 1: LIBI-MRNet (hist) [228 bytes] TaylorGroves (Talk | contribs) (Created page with "=LIBINetwork.C= ==Functions== <code><pre> void get_Identity( SerialGraph* sg, int & n, const char * myhostname, Rank & myrank, int & mynumchildren, char* &...")
- 16:49, 25 February 2012 Outline of anticipated work to update LIBI - Feb 2012 (hist) [9,983 bytes] TaylorGroves (Talk | contribs) (Created page with "The point I'm starting from is the README out of Josh's [https://svn.cs.unm.edu/ssl/projects/mrnet_libi/ SVN repo]. In there it states: This branch requires a customized ver...")
- 14:54, 25 January 2012 CS 591 Virtualization (hist) [851 bytes] TaylorGroves (Talk | contribs) (Created page with "=Notes= ==January 23, 2012== *Shadow paging covered briefly. ==January 25, 2012== ===Paravirtualization vs Full virtualization=== Discussing *VMWare implemented binary transl...")
- 09:45, 19 January 2012 North American Bird Checklist (hist) [137,701 bytes] TaylorGroves (Talk | contribs) (Created page with "{{TOCright}} This list is based on the North American Checklist of the American Ornithologists Union supplemented by checklists from Panama, Greenland, Bermuda and Trinidad and T...")
- 14:27, 30 November 2011 CS 591 Stochastic Modeling (hist) [2,503 bytes] TaylorGroves (Talk | contribs) (Created page with "=Project= The main goal of this project is to become more familiar with Bayes Nets. These seem like one of the more powerful tools we've discussed in this class. That being sai...")
- 22:11, 24 September 2011 Paper IPDPS 12 (hist) [2,674 bytes] TaylorGroves (Talk | contribs) (Created page with "=Abstract= As high-performance systems continue to expand in power and size --scalable, autonomic approaches are desired to maximize system utilization. In addressing the issue ...")
- 12:49, 14 September 2011 Problem Outline: Paper 1 (hist) [2,444 bytes] TaylorGroves (Talk | contribs) (Created page with "=Problem Statement= Our goal is to minimize <math>\alpha + n\beta + \gamma + \theta(x) + Max(child\;perf.) </math>, where: ==Input== *A set of Nodes\Vertices $V$ *A set of '''Te...")
- 09:08, 9 September 2011 Steiner Tree Approximations (hist) [1,266 bytes] TaylorGroves (Talk | contribs) (Created page with "=Tighter Bounds for a Graph Steiner Tree Approximation= *Authors: Gabriel Robins, Alexander Zelikovsky *Year: 2005 "Algorithm adds full components to a growing solution based on...")
- 09:11, 24 August 2011 08-24-11 (hist) [3,832 bytes] TaylorGroves (Talk | contribs) (Created page with "=Summary of Proposed Work= This paper is devoted to the creation of a general purpose model of tree-based overlay networks. While the infrastructure used to develop this...")
- 22:53, 28 July 2011 PL Key Concepts (hist) [9,097 bytes] TaylorGroves (Talk | contribs) (Created page with "=Deepak Definitions= *'''clause''': a finite set of literals *'''complete partially ordered set''' *'''continuous function as in denotational semantics''' *'''fixed point of a ...")
- 14:14, 28 July 2011 Theory Key Concepts (hist) [827 bytes] TaylorGroves (Talk | contribs) (Created page with "=NFA and DFA= *Proving regularity *Number of Equivalence Classes *Pumping Lemma =Proving NP-completeness= *3-Sat < Graph-3 Coloring : count=0 *Graph-3 Coloring < 3-Sat : count=1...")
- 18:14, 26 July 2011 Systems Key Concepts (hist) [10,580 bytes] TaylorGroves (Talk | contribs) (Created page with "*'''Associativity (Cache)''' **'''Fully Associative''' **'''Direct Mapped''' *'''Priority Inversion''': When a higher priority task is indirectly preempted by a lower priority ta...")
- 12:37, 26 July 2011 Releated Performance Models (hist) [1,265 bytes] TaylorGroves (Talk | contribs) (Created page with "=Flat Tree= *Hockney: <math> T\;=\;n_s \; \times \; (P-1)\;\times\;(\alpha(m_s)\;+\;\beta(m_s)m_s\;+\;\gamma m_s) </math> **Imporving the performance of collective operations in ...")
- 14:47, 21 June 2011 Comps-2010-Spring (hist) [7,545 bytes] TaylorGroves (Talk | contribs) (Created page with "=Programming Languages= ==Question 3.4 Comparison of approaches to semantics== *Give "key ingredients" to the following approaches **structural operational semantics, natural sem...")
- 10:17, 3 June 2011 Comps-2010-Fall (hist) [13,259 bytes] TaylorGroves (Talk | contribs) (Created page with '=Theory= =Programming Languages= =Systems= ==Question 2.3 IPC== (a) Describe the pros and cons of using shared memory vs. message passing abstractions. *The approach taken by dis…')
- 23:06, 2 June 2011 Comps-2011-Spring (hist) [21,831 bytes] TaylorGroves (Talk | contribs) (Created page with '=Programming Languages= =Theory= ==Question 4 Yakutsk Wedding== Design an algorithm which given a graph <math>G(V,E)</math> and two vertices <math>u \in U,\;v \in V</math> -- det…')
- 14:47, 1 June 2011 Research Overview Summer 2011 (hist) [3,950 bytes] TaylorGroves (Talk | contribs) (Created page with '=2011-06-1 update= I've been doing 2 batches of testing. I did a more comprehensive run over an expanding fanout: *32 runs in increments of 8 *0 Aggregation latency (filter time…')
