mirror of
https://github.com/actions/cache.git
synced 2024-12-27 09:45:24 +01:00
Test out higher concurrency limits
This commit is contained in:
parent
16019b42a9
commit
4fcbc07edb
3 changed files with 3 additions and 3 deletions
2
dist/restore/index.js
vendored
2
dist/restore/index.js
vendored
|
@ -1622,7 +1622,7 @@ function uploadFile(restClient, cacheId, archivePath) {
|
|||
const resourceUrl = getCacheApiUrl() + "caches/" + cacheId.toString();
|
||||
const responses = [];
|
||||
const fd = fs.openSync(archivePath, "r"); // Use the same fd for serial reads? Will this work for parallel too?
|
||||
const concurrency = 4; // # of HTTP requests in parallel
|
||||
const concurrency = 8; // # of HTTP requests in parallel
|
||||
const threads = [...new Array(concurrency).keys()];
|
||||
core.debug("Awaiting all uploads");
|
||||
let offset = 0;
|
||||
|
|
2
dist/save/index.js
vendored
2
dist/save/index.js
vendored
|
@ -1622,7 +1622,7 @@ function uploadFile(restClient, cacheId, archivePath) {
|
|||
const resourceUrl = getCacheApiUrl() + "caches/" + cacheId.toString();
|
||||
const responses = [];
|
||||
const fd = fs.openSync(archivePath, "r"); // Use the same fd for serial reads? Will this work for parallel too?
|
||||
const concurrency = 4; // # of HTTP requests in parallel
|
||||
const concurrency = 8; // # of HTTP requests in parallel
|
||||
const threads = [...new Array(concurrency).keys()];
|
||||
core.debug("Awaiting all uploads");
|
||||
let offset = 0;
|
||||
|
|
|
@ -181,7 +181,7 @@ async function uploadFile(restClient: RestClient, cacheId: number, archivePath:
|
|||
const responses: IRestResponse<void>[] = [];
|
||||
const fd = fs.openSync(archivePath, "r"); // Use the same fd for serial reads? Will this work for parallel too?
|
||||
|
||||
const concurrency = 4; // # of HTTP requests in parallel
|
||||
const concurrency = 8; // # of HTTP requests in parallel
|
||||
const threads = [...new Array(concurrency).keys()];
|
||||
core.debug("Awaiting all uploads");
|
||||
let offset = 0;
|
||||
|
|
Loading…
Reference in a new issue