archive-edu.com » EDU » R » RPI.EDU

Total: 920

Choose link from "Titles, links and description words view":

Or switch to "Titles and links view".
  • ParMA: Main Page
    Int Workshop on Domain Specific Languages and High Level Frameworks for High Performance Computing WOLFHPC 2012 M Zhou O Sahni T Xie M S Shephard and K E Jansen Unstructured Mesh Partition Improvement for Implicit Finite Element at Extreme Scale J Supercomputing 59 3 1218 1228 2012 M Zhou T Xie S Seol M S Shephard and O Sahni and K E Jansen Tools to Support Mesh Adaptation on Massively

    Original URL path: http://www.scorec.rpi.edu/parma/doxygen/index.html (2015-07-15)
    Open archived version from archive


  • SCOREC - You must be logged in to access this page.
    SquirrelMail version 1 4 23 SVN By the SquirrelMail Project Team ERROR You must be logged in to access this page Go to the login page

    Original URL path: https://www.scorec.rpi.edu/webmail/src/redirect.php (2015-07-15)
    Open archived version from archive

  • SCOREC Webmail Gateway - Signout
    Sign Out You have been successfully signed out Click here to log back in

    Original URL path: https://www.scorec.rpi.edu/webmail/src/signout.php (2015-07-15)
    Open archived version from archive

  • Adaptive Wake Capturing
    Wake Capturing Continued In the following diagram vorticity contours are shown before and after adaptive refinement The capturing of the secondary wake can be observed in the diagram of the

    Original URL path: http://www.scorec.rpi.edu/AdaptiveWake4.html (2015-07-15)
    Open archived version from archive

  • SCOREC core: The SCOREC core tools
    core tools Welcome to the SCOREC core documentation The following packages are documented PCU APF MDS MeshAdapt GMI APF Zoltan ParMA SPR VIZ Repository Home https github com SCOREC core wiki All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator

    Original URL path: http://www.scorec.rpi.edu/~dibanez/core/index.html (2015-07-15)
    Open archived version from archive

  • Red-black Trees
    a general framework that could describe all the balancing implementations at the time including AVL trees It only requires 2 states 1 bit per node They describe several different versions of the tree with different performance tradeoffs faster search vs faster insert They were working at Xerox PARC with the first printers and they liked the colors black and red best for drawing pictures of their trees so they are now called red black trees red black trees require only 1 bit instead of 2 per node for their state and provide faster insertion by doing less balancing work and enforcing a less strict balancing requirement AVL trees enforce a stricter mathematical bound on their balance so their insertion takes longer and does more rotations but their search is asymptotically faster Today red black trees have become the de facto implementation of self balancing binary trees The most widely used implementation is used to implement std set and std map by the GNU C STL My particular Linux machine has those headers under usr include c 4 7 2 bits stl tree h Ironically this implementation ends up using a 32 bit integer enum to store the 1 bit state

    Original URL path: http://www.scorec.rpi.edu/~dibanez/red-black.html (2015-07-15)
    Open archived version from archive

  • ParMA: File Index
    Members File List Here is a list of all files with brief descriptions mainpage h code parma h code All Files Functions Generated on Tue Jul 15 2014 17 34

    Original URL path: http://www.scorec.rpi.edu/parma/doxygen/files.html (2015-07-15)
    Open archived version from archive

  • ParMA: parma.h File Reference
    part splitting apf Splitter Parma MakeRibSplitter apf Mesh m bool sync true create an APF Splitter using recursive inertial bisection apf MeshTag Parma WeighByMemory apf Mesh m create a mesh tag that weighs elements by their memory consumption Function Documentation void Parma GetDisconnectedStats apf Mesh m int max double avg int loc get the maximum average and local number of face disconnected components Parameters mesh In partitioned mesh max InOut max disconnected avg InOut average disconnected isMax InOut local disconnected void Parma GetEntImbalance apf Mesh mesh double entImb 4 get entity imbalance Parameters mesh InOut partitioned mesh entImb InOut entity imbalance vtx edge face rgn void Parma GetNeighborStats apf Mesh m int max double avg int loc get the maximum and average number of vtx connected neighboring parts Remarks for each part count the number of parts it shares mesh vertices with Parameters mesh In partitioned mesh max InOut max neighbors avg InOut average neighbors loc InOut local neighbors count long Parma GetNumBdryVtx apf Mesh m get the number of vertices on inter part boundaries Parameters mesh In partitioned mesh Returns number of vertices void Parma GetWeightedEntImbalance apf Mesh mesh apf MeshTag weight double entImb 4 see Parma GetEntImbalance Parameters mesh InOut partitioned mesh weight In element weight used for computing imbalance entImb InOut entity imbalance vtx edge face rgn apf Balancer Parma MakeCentroidDiffuser apf Mesh m double stepFactor 0 1 create an APF Balancer using centroid diffusion Parameters mesh In partitioned mesh stepFactor In amount of weight to migrate between parts during diffusion lower values migrate fewer elements per iteration Returns apf balancer instance apf Balancer Parma MakeGhostDiffuser apf Mesh m int layers int bridge double stepFactor 0 1 int verbosity 0 create an APF Balancer using ghost element aware diffusion Parameters mesh In partitioned mesh layers In depth of ghosting bridge In dimension of entity ghosting depth is based on typically meshDim 1 stepFactor In amount of weight to migrate between parts during diffusion lower values migrate fewer elements per iteration verbosity In output control higher values output more Returns apf balancer instance apf Balancer Parma MakeHpsBalancer apf Mesh m int verbosity 0 create an APF Balancer using heavy part splitting Parameters mesh In partitioned mesh verbosity In output control higher values output more Returns apf balancer instance apf Splitter Parma MakeRibSplitter apf Mesh m bool sync true create an APF Splitter using recursive inertial bisection Parameters mesh In partitioned mesh sync In true if all parts will be split false o w Returns apf splitter instance void Parma PrintPtnStats apf Mesh m std string key prints partition stats Remarks includes face disconnected components number of vertices on inter part boundaries number of vtx connected neighboring parts entity imbalance and number of empty parts Parameters mesh In partitioned mesh key In identifying string to write with stat output void Parma ProcessDisconnectedParts apf Mesh m re connect disconnected parts Parameters mesh In partitioned mesh int Parma Run apf Mesh mesh apf MeshTag weight const double maxImb run partition improvement

    Original URL path: http://www.scorec.rpi.edu/parma/doxygen/parma_8h.html (2015-07-15)
    Open archived version from archive



  •