Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

Revision 0b02b9669ee209f894695a80da4fb88ecf097cee authored by Eh Tan on 12 September 2007, 19:23:56 UTC, committed by Eh Tan on 12 September 2007, 19:23:56 UTC
Using drand48() instead of rand() to improve the quality of random tracers. Added some debugging output if the tracer count is low.
1 parent f8219a2
  • Files
  • Changes
  • 0c1fe97
  • /
  • CitcomS
  • /
  • MultiLayout.py
Raw File Download
Permalinks

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • revision
  • directory
  • content
revision badge
swh:1:rev:0b02b9669ee209f894695a80da4fb88ecf097cee
directory badge Iframe embedding
swh:1:dir:53a4f5ac099de8d1ad40f8b65bd66c8d0e2db711
content badge Iframe embedding
swh:1:cnt:4ee3ec19eba52acf7a05c7a79e1f676c9948b738
Citations

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • revision
  • directory
  • content
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
MultiLayout.py
#!/usr/bin/env python

#
# Layout for MultiCoupled Application
#
#


from Layout import Layout

class MultiLayout(Layout):


    def __init__(self, name, facility):
        Layout.__init__(self, name, facility)

        # containing communicator
        self.ccomm = None

        # embedded comminicator1
        self.ecomm1 = None

        # embedded comminicator2
        self.ecomm2 = None

        # list of communicators created to pass imformation
        # between different solvers
        self.ccommPlus1 = []
        self.ccommPlus2 = []
        self.ecommPlus1 = []
        self.ecommPlus2 = []

        self.comm = None
        self.rank = 0
        self.nodes = 0
        return


    def verify(self, application):
        # check that we have at least 3 processor
        if self.nodes < 3:
            import journal
            firewall = journal.firewall("MultiLayout")
            firewall.log("'%s' requires at least 3 processors" \
                         % application.name)


        containing_group = self.inventory.containing_group
        embedded_group1 = self.inventory.embedded_group1
        embedded_group2 = self.inventory.embedded_group2

        # check for duplicated elements in the group
        self.check_duplicated(containing_group)
        self.check_duplicated(embedded_group1)
        self.check_duplicated(embedded_group2)

        # check that the three groups are disjoint
        self.check_disjoint(containing_group, embedded_group1)
        self.check_disjoint(containing_group, embedded_group2)
        self.check_disjoint(embedded_group1, embedded_group2)

        return



    def createCommunicators(self):
        # Create communicators for solvers and couplerd

        world = self.comm
        myrank = self.rank
        containing_group = self.inventory.containing_group
        embedded_group1 = self.inventory.embedded_group1
        embedded_group2 = self.inventory.embedded_group2

        # Communicator for solvers
        self.ccomm = world.include(containing_group)
        self.ecomm1 = world.include(embedded_group1)
        self.ecomm2 = world.include(embedded_group2)

        # Communicator for inter-solver communication
        # ecommPlus1 is a list of communicators, with each communicator
        # contains a node in embedded_group1 and the whole containing_group

        # ecommPlus2 is similar
        for node in containing_group:
            self.ecommPlus1.append(world.include(embedded_group1 + [node]))
            self.ecommPlus2.append(world.include(embedded_group2 + [node]))

        # ccommPlus1 is a list of communicators, with each communicator
        # contains a node in containing group and the whole embedded_group1

        # commPlus2 is similar
        for node in embedded_group1:
            self.ccommPlus1.append(world.include(containing_group + [node]))
        for node in embedded_group2:
            self.ccommPlus2.append(world.include(containing_group + [node]))

        return


    class Inventory(Layout.Inventory):

        import pyre.inventory

        # The containing solver will run on these nodes
        containing_group = pyre.inventory.slice("containing_group",
                                                default=range(12))

        # The embedded solver1 will run on these nodes
        embedded_group1 = pyre.inventory.slice("embedded_group1",
                                               default=[12])

        # The embedded solver2 will run on these nodes
        embedded_group2 = pyre.inventory.slice("embedded_group2",
                                               default=[13])


# version
__id__ = "$Id$"

# End of file
The diff you're trying to view is too large. Only the first 1000 changed files have been loaded.
Showing with 0 additions and 0 deletions (0 / 0 diffs computed)
swh spinner

Computing file changes ...

Software Heritage — Copyright (C) 2015–2025, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Contact— JavaScript license information— Web API

back to top