306 | project aims to develop a fast algorithm

by timovv Java Version: v0.1.0-basic-milestone License: No License

X-Ray Key Features Code Snippets Community Discussions Vulnerabilities Install Support

kandi X-RAY | 306 Summary

306 is a Java library. 306 has no bugs, it has no vulnerabilities, it has build file available and it has low support. You can download it from GitHub.

This project aims to develop a fast algorithm to solve optimal task scheduling on multiple processors. We have implemented three different algorithms, DFS branch-and-bound, A* and a parallel version of DFS branch-and-bound. DFSBnB is typically used for its higher speed in testing and low memory usage. Parallel DFSBnB is used when multiple processors are specified by the user. These algorithms all run on a allocation-ordering (AO) search space. To find schedules, tasks are first allocated to a processor. Then, the tasks on each processor are ordered to form a valid schedule.

Support

Quality

Security

License

Reuse

Support

306 has a low active ecosystem.

It has 2 star(s) with 3 fork(s). There are 2 watchers for this library.

It had no major release in the last 12 months.

There are 3 open issues and 22 have been closed. On average issues are closed in 5 days. There are no pull requests.

It has a neutral sentiment in the developer community.

The latest version of 306 is v0.1.0-basic-milestone

Quality

306 has no bugs reported.

Security

306 has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.

License

306 does not have a standard license declared.

Check the repository for any license declaration and review the terms closely.

Without a license, all rights are reserved, and you cannot use the library in your applications.

Reuse

306 releases are available to install and integrate.

Build file is available. You can build the component from source.

Installation instructions, examples and code snippets are available.

Top functions reviewed by kandi - BETA

kandi has reviewed 306 and discovered the below as its top functions. This is intended to give you an instant insight into 306 implemented functionality, and help decide if they suit your requirements.

Starts the program
Parses the options
Parse and return the configuration
Returns a string containing the help information
The main loop
Start polling
Set up the stats box
Sets up the chart
Allocates the next solution in the pipeline
Creates an allocation from a given APartial solution
Make an empty partial solution
Build the graph
Build arrays of edges
Calculate the optimal schedule
Returns a schedule based on the topological ordering algorithm
Layout the data points
Updates the best text for the specified task
Expand all tasks in the plan
Outputs the optimal graph
Update the range range
Calculate the optimal solution
Find the best solution in the tree
Add an edge between two nodes
Add edges to the graph
Handles creation of a series
Get the estimated finish time

Get all kandi verified functions for this library.

306 Key Features

No Key Features are available at this moment for 306.

306 Examples and Code Snippets

No Code Snippets are available at this moment for 306.

Community Discussions

No Community Discussions are available at this moment for 306.Refer to stack overflow page for discussions.

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install 306

Import as Gradle project in Intellij (preferably enable auto-import). Install Lombok Intellij plugin.
Clone the repo:
Import as Gradle project in Intellij (preferably enable auto-import)
Install Lombok Intellij plugin
Run the following Gradle task:

Support

For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .

Find more information at: