| @@ 161-213 (lines=53) @@ | ||
| 158 | assert d_time > 1.4 |
|
| 159 | ||
| 160 | ||
| 161 | def test_shared_memory_3(): |
|
| 162 | c_time = time.perf_counter() |
|
| 163 | hyper = Hyperactive(n_processes=1) |
|
| 164 | hyper.add_search( |
|
| 165 | model, |
|
| 166 | search_space, |
|
| 167 | n_iter=300, |
|
| 168 | n_jobs=1, |
|
| 169 | ) |
|
| 170 | hyper.run() |
|
| 171 | d_time_1 = time.perf_counter() - c_time |
|
| 172 | ||
| 173 | c_time = time.perf_counter() |
|
| 174 | hyper = Hyperactive(n_processes=1) |
|
| 175 | hyper.add_search( |
|
| 176 | model, |
|
| 177 | search_space, |
|
| 178 | n_iter=300, |
|
| 179 | n_jobs=1, |
|
| 180 | memory=True, |
|
| 181 | ) |
|
| 182 | hyper.add_search( |
|
| 183 | model, |
|
| 184 | search_space, |
|
| 185 | n_iter=300, |
|
| 186 | n_jobs=1, |
|
| 187 | memory=True, |
|
| 188 | ) |
|
| 189 | hyper.add_search( |
|
| 190 | model, |
|
| 191 | search_space, |
|
| 192 | n_iter=300, |
|
| 193 | n_jobs=1, |
|
| 194 | memory=True, |
|
| 195 | ) |
|
| 196 | hyper.add_search( |
|
| 197 | model, |
|
| 198 | search_space, |
|
| 199 | n_iter=300, |
|
| 200 | n_jobs=1, |
|
| 201 | memory=True, |
|
| 202 | ) |
|
| 203 | hyper.run() |
|
| 204 | d_time_2 = time.perf_counter() - c_time |
|
| 205 | d_time_2 = d_time_2 / 4 |
|
| 206 | ||
| 207 | print("\n d_time_1 \n", d_time_1) |
|
| 208 | print("\n d_time_2 \n", d_time_2) |
|
| 209 | ||
| 210 | d_time = d_time_1 / d_time_2 |
|
| 211 | ||
| 212 | assert d_time > 0.7 |
|
| 213 | assert d_time < 1.3 |
|
| 214 | ||
| 215 | ||
| 216 | def test_shared_memory_warm_start_0(): |
|
| @@ 107-158 (lines=52) @@ | ||
| 104 | assert d_time < 1.3 |
|
| 105 | ||
| 106 | ||
| 107 | def test_shared_memory_2(): |
|
| 108 | c_time = time.perf_counter() |
|
| 109 | hyper = Hyperactive(n_processes=1) |
|
| 110 | hyper.add_search( |
|
| 111 | model, |
|
| 112 | search_space, |
|
| 113 | n_iter=300, |
|
| 114 | n_jobs=1, |
|
| 115 | ) |
|
| 116 | hyper.run() |
|
| 117 | d_time_1 = time.perf_counter() - c_time |
|
| 118 | ||
| 119 | c_time = time.perf_counter() |
|
| 120 | hyper = Hyperactive(n_processes=1) |
|
| 121 | hyper.add_search( |
|
| 122 | model, |
|
| 123 | search_space, |
|
| 124 | n_iter=300, |
|
| 125 | n_jobs=1, |
|
| 126 | memory="share", |
|
| 127 | ) |
|
| 128 | hyper.add_search( |
|
| 129 | model, |
|
| 130 | search_space, |
|
| 131 | n_iter=300, |
|
| 132 | n_jobs=1, |
|
| 133 | memory="share", |
|
| 134 | ) |
|
| 135 | hyper.add_search( |
|
| 136 | model, |
|
| 137 | search_space, |
|
| 138 | n_iter=300, |
|
| 139 | n_jobs=1, |
|
| 140 | memory="share", |
|
| 141 | ) |
|
| 142 | hyper.add_search( |
|
| 143 | model, |
|
| 144 | search_space, |
|
| 145 | n_iter=300, |
|
| 146 | n_jobs=1, |
|
| 147 | memory="share", |
|
| 148 | ) |
|
| 149 | hyper.run() |
|
| 150 | d_time_2 = time.perf_counter() - c_time |
|
| 151 | d_time_2 = d_time_2 / 4 |
|
| 152 | ||
| 153 | print("\n d_time_1 \n", d_time_1) |
|
| 154 | print("\n d_time_2 \n", d_time_2) |
|
| 155 | ||
| 156 | d_time = d_time_1 / d_time_2 |
|
| 157 | ||
| 158 | assert d_time > 1.4 |
|
| 159 | ||
| 160 | ||
| 161 | def test_shared_memory_3(): |
|