@@ -128,2 +170,4 @@
 	}, nil
 }
+
+func (e *StorageEngine) ListWithMultiCursor(prm ListWithMultiCursorPrm) (ListWithMultiCursorRes, error) {

@@ -130,0 +204,4 @@
+		}
+
+		for i := range multiCursor.cursors {
+			if multiCursor.cursors[i] == nil {

@@ -127,3 +169,121 @@ func (e *StorageEngine) ListWithCursor(prm ListWithCursorPrm) (ListWithCursorRes
 		cursor:   cursor,
 	}, nil
 }
+

@@ -130,0 +189,4 @@
+	// Set initial cursors
+	multiCursor := prm.multiCursor
+	if multiCursor == nil {
+		var cursorCount uint32 = defaultCursorsNum

@@ -24,2 +24,4 @@
 	return res.AddressList(), res.Cursor(), nil
 }
+
+func (q *jobQueue) SelectWithMultiCursor(multiCursor *engine.MultiCursor, count uint32) ([]objectcore.AddressWithType, *engine.MultiCursor, error) {

@@ -59,1 +70,4 @@
 //
+// If count parameter (i.e. batch size) and shard number are big enough,
+// then few (for defaultCursorsNum) shard cursors read objects concurrently.
+// In this case sorted shard ids are divided into groups by shardIndex % cursorIndex

@@ -70,3 +85,1 @@
-	}
-	e.mtx.RUnlock()
-
+	shardIDs := getSortedShardIDs(e)

@@ -112,3 +96,1 @@
-		if err != nil {
-			continue
-		}
+	batchPerCursor := int(prm.count) / len(cursor.shardCursorWrappers)

@@ -52,72 +78,91 @@ func (l ListWithCursorRes) Cursor() *Cursor {
 	return l.cursor
 }
 
+const (

@@ -60,0 +93,4 @@
+//
+// Adding a shard between ListWithCursor does not invalidate the cursor but new shard
+// won't be listed.
+// Removing a shard between ListWithCursor leads to the undefined behavior

@@ -116,3 +119,1 @@
-		result = append(result, res.AddressList()...)
-		cursor.shardCursor = res.Cursor()
-		cursor.shardID = shardIDs[i]
+	wg := &sync.WaitGroup{}

@@ -130,0 +180,4 @@
+		shardIDs = append(shardIDs, id)
+	}
+	e.mtx.RUnlock()
+	sort.Slice(shardIDs, func(i, j int) bool {

@@ -130,0 +187,4 @@
+}
+
+func newCursor(count uint32, shardIDs []string) *Cursor {
+	var cursorCount uint32 = defaultCursorsNum

@@ -130,0 +194,4 @@
+	cursor := &Cursor{
+		shardCursorWrappers: make([]*shardCursorWrapper, cursorCount),
+	}
+	if len(shardIDs) < len(cursor.shardCursorWrappers) {

@@ -21,0 +33,4 @@
+	return
+}
+
+func (s *shardCursorWrapper) setShardCursor(shardCursor *shard.Cursor) {

@@ -21,0 +44,4 @@
+// that point to one or few different shards. This allows to read objects from different
+// shards concurrently.
+type Cursor struct {
+	shardCursorWrappers []*shardCursorWrapper

@@ -128,2 +172,4 @@
 	}, nil
 }
+
+func getSortedShardIDs(e *StorageEngine) []string {

@@ -79,0 +65,4 @@
+			wantCursorsNum: 1,
+		},
+		{
+			name:           "many shards, many objects, small batch size",