lamellar 0.8.0

Lamellar is an asynchronous tasking runtime for HPC systems developed in RUST.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162

use crate::array::iterator::one_sided_iterator::{private::*, *};
use crate::array::rdma::private::{LamellarRdmaGet, Sealed};

use pin_project::pin_project;

#[pin_project]
pub struct Chunks<I>
where
    I: OneSidedIterator + Send,
{
    #[pin]
    iter: I,
    index: usize,
    chunk_size: usize,
    #[pin]
    state: ChunkState<I::ElemType>,
}

#[pin_project(project = ChunkStateProj)]
enum ChunkState<E: Dist> {
    Pending(#[pin] LamellarTask<Vec<E>>),
    Finished,
}

impl<I> Chunks<I>
where
    I: OneSidedIterator + Send,
{
    pub(crate) fn new(iter: I, chunk_size: usize) -> Chunks<I> {
        // let array = iter.array().clone(); //.to_base::<u8>();
        // println!(" Chunks size: {:?}", chunk_size);

        let chunks = Chunks {
            iter,
            index: 0,
            chunk_size,
            state: ChunkState::Finished,
        };
        chunks
    }
}

impl<I> OneSidedIterator for Chunks<I> where I: OneSidedIterator + Send {}

impl<I> OneSidedIteratorInner for Chunks<I>
where
    I: OneSidedIterator + Send,
{
    type ElemType = I::ElemType;
    type Item = Vec<I::ElemType>;
    type Array = I::Array;

    fn init(&mut self) {
        let array = self.array();
        let size = std::cmp::min(self.chunk_size, array.len() - self.index);
        let new_req = unsafe { array.get_buffer(self.index, size, Sealed).spawn() };
        self.index += size;
        self.state = ChunkState::Pending(new_req);
    }
    fn next(&mut self) -> Option<Self::Item> {
        let array = self.array();
        let mut cur_state = ChunkState::Finished;
        std::mem::swap(&mut self.state, &mut cur_state);
        match cur_state {
            ChunkState::Pending(req) => {
                if self.index < array.len() {
                    //prefetch
                    let size = std::cmp::min(self.chunk_size, array.len() - self.index);
                    let new_req = unsafe { array.get_buffer(self.index, size, Sealed).spawn() };
                    self.index += size;
                    self.state = ChunkState::Pending(new_req);
                } else {
                    self.state = ChunkState::Finished;
                }
                Some(req.block())
            }
            ChunkState::Finished => None,
        }
    }

    fn poll_next(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
        let array = self.array();
        let mut this = self.as_mut().project();

        match this.state.as_mut().project() {
            ChunkStateProj::Pending(req) => match req.poll(cx) {
                Poll::Ready(mem_region) => {
                    if *this.index < array.len() {
                        //prefetch
                        let size = std::cmp::min(*this.chunk_size, array.len() - *this.index);
                        let new_req =
                            unsafe { array.get_buffer(*this.index, size, Sealed).spawn() };
                        *this.index += size;
                        *this.state = ChunkState::Pending(new_req);
                    } else {
                        *this.state = ChunkState::Finished;
                    }
                    Poll::Ready(Some(mem_region))
                }
                Poll::Pending => Poll::Pending,
            },
            ChunkStateProj::Finished => Poll::Ready(None),
        }
    }

    fn advance_index(&mut self, count: usize) {
        self.index += count * self.chunk_size;
    }

    fn advance_index_pin(self: Pin<&mut Self>, count: usize) {
        let this = self.project();
        *this.index += count * *this.chunk_size;
    }

    fn array(&self) -> Self::Array {
        self.iter.array()
    }
    fn item_size(&self) -> usize {
        self.chunk_size * std::mem::size_of::<I::ElemType>()
    }
}

// impl<I> Iterator for Chunks<I>
// where
//     I: OneSidedIterator + Iterator
// {
//     type Item = OneSidedMemoryRegion<I::ElemType>;
//     fn next(&mut self) -> Option<Self::Item> {
//         <Self as OneSidedIterator>::next(self)
//     }
// }

// use futures_util::task::{Context, Poll};
// use futures_util::Stream;
// use std::pin::Pin;

// impl<I> Stream for Chunks<I>
// where
//     I: OneSidedIterator + Stream + Unpin
// {
//     type Item = OneSidedMemoryRegion<I::ElemType>;
//     fn poll_next(mut self: Pin<&mut Self>, _cx: &mut Context<'_>) -> Poll<Option<Self::Item>> {
//         // println!("{:?} {:?}",self.index,self.array.len()/std::mem::size_of::<<Self as OneSidedIterator>::ElemType>());
//         println!("async getting {:?} {:?}",self.index,self.chunk_size);
//         if self.index < self.array.len(){
//             let size = std::cmp::min(self.chunk_size, self.array.len() - self.index);
//             // self.fill_buffer(0, &self.mem_region.sub_region(..size));
//             let mem_region: OneSidedMemoryRegion<I::ElemType> = self.array.team().alloc_one_sided_mem_region(size);
//             self.fill_buffer(101010101, &mem_region);
//             if self.check_for_valid(101010101,&mem_region){
//                 self.index += size;
//                 Poll::Ready(Some(mem_region))
//             }
//             else{
//                 Poll::Pending
//             }
//         }
//         else{
//             Poll::Ready(None)
//         }
//     }
// }