Showing 3 open source projects for "graph c#"

View related business solutions
  • Find out just how much your login box can do for your customer | Auth0 Icon
    Find out just how much your login box can do for your customer | Auth0

    With over 53 social login options, you can fast-track the signup and login experience for users.

    From improving customer experience through seamless sign-on to making MFA as easy as a click of a button – your login box must find the right balance between user convenience, privacy and security.
  • Pimberly PIM - the leading enterprise Product Information Management platform. Icon
    Pimberly PIM - the leading enterprise Product Information Management platform.

    Pimberly enables businesses to create amazing online experiences with richer, differentiated product descriptions.

    Drive amazing product experiences with quality product data.
  • 1
    PARUS

    PARUS

    Dataflow parallel programming language for clusters

    PARUS is a data-flow parallel programming language that allows to build parallel programs for clusters and MPP multiprocessors. The data-flow graph is automatically converted to the C++/MPI source and linked with the libparus runtime library. Also there are available tools for benchmarking cluster interconnect and visualize it.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2

    ThunderstormDistributor

    Distribute jobs to compute nodes on dynamic clusters

    ThunderstormDistributor is a queuing system that distributes jobs and computational workload across dynamic clusters in the cloud. It manages the assignment of jobs to maximize CPU and memory usage and prevent oversubscription of compute nodes. It also performs advanced statistics collection on individual compute nodes and jobs to graph the distribution of disk, network, CPU, and memory usage over time, which facilitates the advanced optimization and tuning of computational workflows.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Yasa is yet another simulated annealing. Using this metaheuristic we determine near optimal schedules for a given task graph. As this is computationally intensive, we use the pvm library to allow parallel computations on workstation clusters.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next