mirror of
https://github.com/mudler/luet.git
synced 2025-07-12 06:38:16 +00:00
f6a4b634c1
With this change the solver during install now considers only the part of the tree which is required to calculate the solution, it doesn't consider anymore World() as the search space. The search space now is narrowed down to the packages that related to the one which we are considering. In this subset of changes we are also optimizing the Parallel solver avoiding an useless loop. This change boost overall performance on large datasets which don't necessarly have relations touching the whole tree.
251 lines
12 KiB
Go
251 lines
12 KiB
Go
// Copyright © 2019 Ettore Di Giacinto <mudler@gentoo.org>
|
|
//
|
|
// This program is free software; you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation; either version 2 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License along
|
|
// with this program; if not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package solver_test
|
|
|
|
import (
|
|
"fmt"
|
|
"os"
|
|
"strconv"
|
|
|
|
pkg "github.com/mudler/luet/pkg/package"
|
|
. "github.com/onsi/ginkgo"
|
|
. "github.com/onsi/gomega"
|
|
|
|
. "github.com/mudler/luet/pkg/solver"
|
|
)
|
|
|
|
var _ = Describe("Solver Benchmarks", func() {
|
|
db := pkg.NewInMemoryDatabase(false)
|
|
dbInstalled := pkg.NewInMemoryDatabase(false)
|
|
dbDefinitions := pkg.NewInMemoryDatabase(false)
|
|
var s PackageSolver
|
|
|
|
Context("Complex data sets", func() {
|
|
BeforeEach(func() {
|
|
db = pkg.NewInMemoryDatabase(false)
|
|
dbInstalled = pkg.NewInMemoryDatabase(false)
|
|
dbDefinitions = pkg.NewInMemoryDatabase(false)
|
|
s = NewSolver(Options{Type: SingleCoreSimple}, dbInstalled, dbDefinitions, db)
|
|
if os.Getenv("BENCHMARK_TESTS") != "true" {
|
|
Skip("BENCHMARK_TESTS not enabled")
|
|
}
|
|
})
|
|
Measure("it should be fast in resolution from a 50000 dataset", func(b Benchmarker) {
|
|
|
|
runtime := b.Time("runtime", func() {
|
|
for i := 0; i < 50000; i++ {
|
|
C := pkg.NewPackage("C"+strconv.Itoa(i), "", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
E := pkg.NewPackage("E"+strconv.Itoa(i), "", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
F := pkg.NewPackage("F"+strconv.Itoa(i), "", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
G := pkg.NewPackage("G"+strconv.Itoa(i), "", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
H := pkg.NewPackage("H"+strconv.Itoa(i), "", []*pkg.DefaultPackage{G}, []*pkg.DefaultPackage{})
|
|
D := pkg.NewPackage("D"+strconv.Itoa(i), "", []*pkg.DefaultPackage{H}, []*pkg.DefaultPackage{})
|
|
B := pkg.NewPackage("B"+strconv.Itoa(i), "", []*pkg.DefaultPackage{D}, []*pkg.DefaultPackage{})
|
|
A := pkg.NewPackage("A"+strconv.Itoa(i), "", []*pkg.DefaultPackage{B}, []*pkg.DefaultPackage{})
|
|
for _, p := range []pkg.Package{A, B, C, D, E, F, G} {
|
|
_, err := dbDefinitions.CreatePackage(p)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
}
|
|
_, err := dbInstalled.CreatePackage(C)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
}
|
|
|
|
for i := 0; i < 1; i++ {
|
|
C := pkg.NewPackage("C"+strconv.Itoa(i), "", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
G := pkg.NewPackage("G"+strconv.Itoa(i), "", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
H := pkg.NewPackage("H"+strconv.Itoa(i), "", []*pkg.DefaultPackage{G}, []*pkg.DefaultPackage{})
|
|
D := pkg.NewPackage("D"+strconv.Itoa(i), "", []*pkg.DefaultPackage{H}, []*pkg.DefaultPackage{})
|
|
B := pkg.NewPackage("B"+strconv.Itoa(i), "", []*pkg.DefaultPackage{D}, []*pkg.DefaultPackage{})
|
|
A := pkg.NewPackage("A"+strconv.Itoa(i), "", []*pkg.DefaultPackage{B}, []*pkg.DefaultPackage{})
|
|
|
|
solution, err := s.Install([]pkg.Package{A})
|
|
Expect(err).ToNot(HaveOccurred())
|
|
|
|
Expect(solution).To(ContainElement(PackageAssert{Package: A, Value: true}))
|
|
Expect(solution).To(ContainElement(PackageAssert{Package: B, Value: true}))
|
|
Expect(solution).To(ContainElement(PackageAssert{Package: D, Value: true}))
|
|
Expect(solution).To(ContainElement(PackageAssert{Package: C, Value: true}))
|
|
Expect(solution).To(ContainElement(PackageAssert{Package: H, Value: true}))
|
|
Expect(solution).To(ContainElement(PackageAssert{Package: G, Value: true}))
|
|
}
|
|
})
|
|
|
|
Ω(runtime.Seconds()).Should(BeNumerically("<", 120), "Install() shouldn't take too long.")
|
|
}, 1)
|
|
})
|
|
|
|
Context("Complex data sets - Parallel", func() {
|
|
BeforeEach(func() {
|
|
db = pkg.NewInMemoryDatabase(false)
|
|
dbInstalled = pkg.NewInMemoryDatabase(false)
|
|
dbDefinitions = pkg.NewInMemoryDatabase(false)
|
|
s = NewSolver(Options{Type: ParallelSimple, Concurrency: 10}, dbInstalled, dbDefinitions, db)
|
|
if os.Getenv("BENCHMARK_TESTS") != "true" {
|
|
Skip("BENCHMARK_TESTS not enabled")
|
|
}
|
|
})
|
|
Measure("it should be fast in resolution from a 50000 dataset", func(b Benchmarker) {
|
|
runtime := b.Time("runtime", func() {
|
|
for i := 0; i < 50000; i++ {
|
|
C := pkg.NewPackage("C"+strconv.Itoa(i), "", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
E := pkg.NewPackage("E"+strconv.Itoa(i), "", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
F := pkg.NewPackage("F"+strconv.Itoa(i), "", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
G := pkg.NewPackage("G"+strconv.Itoa(i), "", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
H := pkg.NewPackage("H"+strconv.Itoa(i), "", []*pkg.DefaultPackage{G}, []*pkg.DefaultPackage{})
|
|
D := pkg.NewPackage("D"+strconv.Itoa(i), "", []*pkg.DefaultPackage{H}, []*pkg.DefaultPackage{})
|
|
B := pkg.NewPackage("B"+strconv.Itoa(i), "", []*pkg.DefaultPackage{D}, []*pkg.DefaultPackage{})
|
|
A := pkg.NewPackage("A"+strconv.Itoa(i), "", []*pkg.DefaultPackage{B}, []*pkg.DefaultPackage{})
|
|
for _, p := range []pkg.Package{A, B, C, D, E, F, G} {
|
|
_, err := dbDefinitions.CreatePackage(p)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
}
|
|
_, err := dbInstalled.CreatePackage(C)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
}
|
|
for i := 0; i < 1; i++ {
|
|
C := pkg.NewPackage("C"+strconv.Itoa(i), "", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
G := pkg.NewPackage("G"+strconv.Itoa(i), "", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
H := pkg.NewPackage("H"+strconv.Itoa(i), "", []*pkg.DefaultPackage{G}, []*pkg.DefaultPackage{})
|
|
D := pkg.NewPackage("D"+strconv.Itoa(i), "", []*pkg.DefaultPackage{H}, []*pkg.DefaultPackage{})
|
|
B := pkg.NewPackage("B"+strconv.Itoa(i), "", []*pkg.DefaultPackage{D}, []*pkg.DefaultPackage{})
|
|
A := pkg.NewPackage("A"+strconv.Itoa(i), "", []*pkg.DefaultPackage{B}, []*pkg.DefaultPackage{})
|
|
|
|
solution, err := s.Install([]pkg.Package{A})
|
|
Expect(err).ToNot(HaveOccurred())
|
|
|
|
Expect(solution).To(ContainElement(PackageAssert{Package: A, Value: true}))
|
|
Expect(solution).To(ContainElement(PackageAssert{Package: B, Value: true}))
|
|
Expect(solution).To(ContainElement(PackageAssert{Package: D, Value: true}))
|
|
Expect(solution).To(ContainElement(PackageAssert{Package: C, Value: true}))
|
|
Expect(solution).To(ContainElement(PackageAssert{Package: H, Value: true}))
|
|
Expect(solution).To(ContainElement(PackageAssert{Package: G, Value: true}))
|
|
|
|
// Expect(len(solution)).To(Equal(6))
|
|
}
|
|
})
|
|
|
|
Ω(runtime.Seconds()).Should(BeNumerically("<", 70), "Install() shouldn't take too long.")
|
|
}, 1)
|
|
})
|
|
|
|
Context("Complex data sets - Parallel Upgrades", func() {
|
|
BeforeEach(func() {
|
|
db = pkg.NewInMemoryDatabase(false)
|
|
dbInstalled = pkg.NewInMemoryDatabase(false)
|
|
dbDefinitions = pkg.NewInMemoryDatabase(false)
|
|
s = NewSolver(Options{Type: ParallelSimple, Concurrency: 100}, dbInstalled, dbDefinitions, db)
|
|
if os.Getenv("BENCHMARK_TESTS") != "true" {
|
|
Skip("BENCHMARK_TESTS not enabled")
|
|
}
|
|
})
|
|
Measure("it should be fast in resolution from a 10000*8 dataset", func(b Benchmarker) {
|
|
runtime := b.Time("runtime", func() {
|
|
for i := 2; i < 10000; i++ {
|
|
C := pkg.NewPackage("C", strconv.Itoa(i), []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
E := pkg.NewPackage("E", strconv.Itoa(i), []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
F := pkg.NewPackage("F", strconv.Itoa(i), []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
G := pkg.NewPackage("G", strconv.Itoa(i), []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
H := pkg.NewPackage("H", strconv.Itoa(i), []*pkg.DefaultPackage{G}, []*pkg.DefaultPackage{})
|
|
D := pkg.NewPackage("D", strconv.Itoa(i), []*pkg.DefaultPackage{H}, []*pkg.DefaultPackage{})
|
|
B := pkg.NewPackage("B", strconv.Itoa(i), []*pkg.DefaultPackage{D}, []*pkg.DefaultPackage{})
|
|
A := pkg.NewPackage("A", strconv.Itoa(i), []*pkg.DefaultPackage{B}, []*pkg.DefaultPackage{})
|
|
for _, p := range []pkg.Package{A, B, C, D, E, F, G, H} {
|
|
_, err := dbDefinitions.CreatePackage(p)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
}
|
|
}
|
|
|
|
//C := pkg.NewPackage("C", "1", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
G := pkg.NewPackage("G", "1", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
H := pkg.NewPackage("H", "1", []*pkg.DefaultPackage{G}, []*pkg.DefaultPackage{})
|
|
D := pkg.NewPackage("D", "1", []*pkg.DefaultPackage{H}, []*pkg.DefaultPackage{})
|
|
B := pkg.NewPackage("B", "1", []*pkg.DefaultPackage{D}, []*pkg.DefaultPackage{})
|
|
A := pkg.NewPackage("A", "1", []*pkg.DefaultPackage{B}, []*pkg.DefaultPackage{})
|
|
_, err := dbInstalled.CreatePackage(A)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
_, err = dbInstalled.CreatePackage(B)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
_, err = dbInstalled.CreatePackage(D)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
_, err = dbInstalled.CreatePackage(H)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
_, err = dbInstalled.CreatePackage(G)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
fmt.Println("Upgrade starts")
|
|
|
|
packages, ass, err := s.Upgrade(false, true)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
|
|
Expect(packages).To(ContainElement(A))
|
|
|
|
G = pkg.NewPackage("G", "9999", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
H = pkg.NewPackage("H", "9999", []*pkg.DefaultPackage{G}, []*pkg.DefaultPackage{})
|
|
D = pkg.NewPackage("D", "9999", []*pkg.DefaultPackage{H}, []*pkg.DefaultPackage{})
|
|
B = pkg.NewPackage("B", "9999", []*pkg.DefaultPackage{D}, []*pkg.DefaultPackage{})
|
|
A = pkg.NewPackage("A", "9999", []*pkg.DefaultPackage{B}, []*pkg.DefaultPackage{})
|
|
Expect(ass).To(ContainElement(PackageAssert{Package: A, Value: true}))
|
|
|
|
Expect(len(packages)).To(Equal(5))
|
|
// Expect(len(solution)).To(Equal(6))
|
|
|
|
})
|
|
|
|
Ω(runtime.Seconds()).Should(BeNumerically("<", 70), "Install() shouldn't take too long.")
|
|
}, 1)
|
|
|
|
PMeasure("it should be fast in resolution from a 50000 dataset with upgrade universe", func(b Benchmarker) {
|
|
runtime := b.Time("runtime", func() {
|
|
for i := 0; i < 2; i++ {
|
|
C := pkg.NewPackage("C", strconv.Itoa(i), []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
E := pkg.NewPackage("E", strconv.Itoa(i), []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
F := pkg.NewPackage("F", strconv.Itoa(i), []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
G := pkg.NewPackage("G", strconv.Itoa(i), []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
H := pkg.NewPackage("H", strconv.Itoa(i), []*pkg.DefaultPackage{G}, []*pkg.DefaultPackage{})
|
|
D := pkg.NewPackage("D", strconv.Itoa(i), []*pkg.DefaultPackage{H}, []*pkg.DefaultPackage{})
|
|
B := pkg.NewPackage("B", strconv.Itoa(i), []*pkg.DefaultPackage{D}, []*pkg.DefaultPackage{})
|
|
A := pkg.NewPackage("A", strconv.Itoa(i), []*pkg.DefaultPackage{B}, []*pkg.DefaultPackage{})
|
|
for _, p := range []pkg.Package{A, B, C, D, E, F, G} {
|
|
_, err := dbDefinitions.CreatePackage(p)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
}
|
|
fmt.Println("Creating package, run", i)
|
|
}
|
|
|
|
G := pkg.NewPackage("G", "1", []*pkg.DefaultPackage{}, []*pkg.DefaultPackage{})
|
|
H := pkg.NewPackage("H", "1", []*pkg.DefaultPackage{G}, []*pkg.DefaultPackage{})
|
|
D := pkg.NewPackage("D", "1", []*pkg.DefaultPackage{H}, []*pkg.DefaultPackage{})
|
|
B := pkg.NewPackage("B", "1", []*pkg.DefaultPackage{D}, []*pkg.DefaultPackage{})
|
|
A := pkg.NewPackage("A", "1", []*pkg.DefaultPackage{B}, []*pkg.DefaultPackage{})
|
|
_, err := dbInstalled.CreatePackage(A)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
fmt.Println("Upgrade starts")
|
|
|
|
packages, ass, err := s.UpgradeUniverse(true)
|
|
Expect(err).ToNot(HaveOccurred())
|
|
|
|
Expect(ass).To(ContainElement(PackageAssert{Package: pkg.NewPackage("A", "50000", []*pkg.DefaultPackage{B}, []*pkg.DefaultPackage{}), Value: true}))
|
|
Expect(packages).To(ContainElement(pkg.NewPackage("A", "50000", []*pkg.DefaultPackage{B}, []*pkg.DefaultPackage{})))
|
|
Expect(packages).To(Equal(5))
|
|
// Expect(len(solution)).To(Equal(6))
|
|
|
|
})
|
|
|
|
Ω(runtime.Seconds()).Should(BeNumerically("<", 70), "Install() shouldn't take too long.")
|
|
}, 1)
|
|
})
|
|
|
|
})
|