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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
extern crate priority_queue;
use crate::engine::{agent::Agent, agentimpl::AgentImpl, priority::Priority, state::State};
use cfg_if::cfg_if;
use priority_queue::PriorityQueue;
use std::fmt;
cfg_if! {
if #[cfg(feature ="parallel")]{
use crossbeam::thread;
use std::sync::{Arc,Mutex};
use clap::{App, Arg};
use lazy_static::*;
}
}
cfg_if! {
if #[cfg(feature ="parallel")]{
lazy_static! {
pub static ref THREAD_NUM: usize = {
let matches = App::new("krABMaga")
.arg(Arg::with_name("bench").long("bench"))
.arg(
Arg::with_name("num_thread")
.help("sets the number of threads to use")
.takes_value(true)
.long("nt"),
)
.get_matches();
let n = match matches.value_of("num_thread") {
Some(nt) => match nt.parse::<usize>() {
Ok(ris) => ris,
Err(_) => {
eprintln!("error: --nt value is not an integer");
num_cpus::get()
}
},
_ => 1,
};
n
};
}
}
}
cfg_if! {
if #[cfg(feature ="parallel")] {
pub struct Schedule {
pub step: usize,
pub time: f32,
pub events: Arc<Mutex<PriorityQueue<AgentImpl, Priority>>>,
pub thread_num:usize,
pub agent_ids_counting: Arc<Mutex<u32>>,
}
#[derive(Clone)]
pub struct Pair {
agentimpl: AgentImpl,
priority: Priority,
}
impl Pair {
#[allow(dead_code)]
fn new(agent: AgentImpl, the_priority: Priority) -> Pair {
Pair {
agentimpl: agent,
priority: the_priority
}
}
}
impl fmt::Display for Pair {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "agent: {} priority: {}", self.agentimpl, self.priority)
}
}
impl Schedule {
pub fn new() -> Schedule {
Schedule {
step: 0,
time: 0.0,
events: Arc::new(Mutex::new(PriorityQueue::new())),
thread_num: *THREAD_NUM,
agent_ids_counting: Arc::new(Mutex::new(0)),
}
}
pub fn with_threads(thread_num: usize) -> Schedule {
Schedule {
step: 0,
time: 0.0,
events: Arc::new(Mutex::new(PriorityQueue::new())),
thread_num,
agent_ids_counting: Arc::new(Mutex::new(0)),
}
}
pub fn schedule_once(&mut self, agent: AgentImpl, the_time:f32, the_ordering:i32) {
self.events.lock().expect("error on lock").push(
agent,
Priority {
time: the_time,
ordering: the_ordering,
},
);
}
pub fn schedule_repeating(&mut self, agent: Box<dyn Agent>, the_time:f32, the_ordering:i32) {
let mut agent_ids_counting = self.agent_ids_counting.lock().expect("error on lock");
let mut a = AgentImpl::new(agent, *agent_ids_counting);
*agent_ids_counting +=1;
a.repeating = true;
let pr = Priority::new(the_time, the_ordering);
self.events.lock().expect("error on lock").push(a, pr);
}
pub fn get_all_events(&self) -> Vec<Box<dyn Agent>>{
let mut tor: Vec<Box<dyn Agent>> = Vec::new();
for e in self.events.lock().expect("error on lock").iter(){
tor.push(e.0.agent.clone());
}
tor
}
pub fn step(&mut self, state: &mut dyn State) {
let thread_num = self.thread_num;
let thread_division = (self.events.lock().expect("error on lock").len() as f64 / thread_num as f64).ceil() as usize;
let mut state = Arc::new(Mutex::new(state));
if self.step == 0{
Arc::get_mut(&mut state).expect("error on get_mut").lock().expect("error on lock").update(self.step.clone() as u64);
}
Arc::get_mut(&mut state).expect("error on get_mut").lock().expect("error on lock").before_step(self);
if self.events.lock().expect("error on lock").is_empty() {
println!("No agent in the queue to schedule. Terminating.");
//TODO check if we need to exit on 0 agents or we have to continue until new agents are spawned
std::process::exit(0);
}
let mut cevents: Vec<Vec<Pair>> = vec![Vec::with_capacity(thread_division); thread_num];
match self.events.lock().expect("error on lock").peek() {
Some(item) => {
let (_agent, priority) = item;
self.time = priority.time;
},
None => panic!("Agent not found - out loop")
}
let mut i = 0;
loop {
if self.events.lock().expect("error on lock").is_empty() {
break;
}
let item = self.events.lock().expect("error on lock").pop();
match item {
Some(item) => {
let (agent, priority) = item;
let index = match thread_num{
0 => 0,
_ => i%thread_num
};
cevents[index].push(Pair::new(agent, priority));
i+=1;
},
None => panic!("no item"),
}
}
let _result = thread::scope( |scope| {
for _tid in 0..thread_num {
let events = Arc::clone(&self.events);
let state = Arc::clone(&state);
let mut batch = cevents.pop().expect("error on pop");
scope.spawn(move |_| {
for item in batch.iter_mut(){
// take the lock from the state
let mut state = state.lock().expect("error on lock");
let state = state.as_state_mut();
// compute the agent
item.agentimpl.agent.before_step(state);
item.agentimpl.agent.step(state);
item.agentimpl.agent.after_step(state);
// after computation check if repeating and not stopped
if item.agentimpl.repeating && !item.agentimpl.agent.is_stopped(state) {
// take the lock from the queue
let mut q = events.lock().expect("error on lock");
// schedule_once transposition
q.push(
item.agentimpl.clone(),
Priority {
time: item.priority.time + 1.0,
ordering: item.priority.ordering,
},
);
// continue on the next item
continue;
}
}
});
}
});
Arc::get_mut(&mut state).expect("error on get_mut")
.lock().expect("error on lock").after_step(self);
self.step += 1;
Arc::get_mut(&mut state).expect("error on get_mut")
.lock().expect("error on lock").update(self.step.clone() as u64);
}
}
}
// SEQUENTIAL IF
else{
/// Struct to manage all the agents in the simulation
pub struct Schedule{
/// Current step of the simulation
pub step: u64,
/// Current time of the simulation
pub time: f32,
/// Priority queue filled with a pair of AgentImpl and his Priority
pub events: PriorityQueue<AgentImpl,Priority>,
/// Unique ids inside schedule
pub agent_ids_counting: u32,
}
/// internal struct to manage the AgentImpl in a more convenient way
#[derive(Clone)]
struct Pair{
agentimpl: AgentImpl,
priority: Priority,
}
impl Pair {
fn new(agent: AgentImpl, the_priority: Priority) -> Pair {
Pair {
agentimpl: agent,
priority: the_priority
}
}
}
impl fmt::Display for Pair {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "agent: {} priority: {}", self.agentimpl, self.priority)
}
}
impl Default for Schedule {
fn default() -> Self {
Self::new()
}
}
impl Schedule {
/// Create a new instance for Schedule
pub fn new() -> Schedule {
Schedule {
step: 0,
time: 0.0,
events: PriorityQueue::new(),
agent_ids_counting: 0,
}
}
/// Onsert an agent in the PriorityQueue for one step
///
/// # Arguments
/// * `agent` - Agent to schedule
/// * `the_time` - Time to schedule the agent
/// * `the_ordering` - Ordering of the agent inside the queue
pub fn schedule_once(&mut self, agent: AgentImpl, the_time:f32, the_ordering:i32) {
self.events.push(agent, Priority{time: the_time, ordering: the_ordering});
}
/// Insert an agent in the PriorityQueue with the repeating field set at true.
///
/// Return false if the insertion in the priority queue fails.
///
/// # Arguments
/// * `agent` - Agent to schedule
/// * `the_time` - Time to schedule the agent
/// * `the_ordering` - Ordering of the agent inside the queue
pub fn schedule_repeating(&mut self, agent: Box<dyn Agent>, the_time:f32, the_ordering:i32) -> bool {
let mut a = AgentImpl::new(agent, self.agent_ids_counting);
self.agent_ids_counting +=1;
a.repeating = true;
let pr = Priority::new(the_time, the_ordering);
let opt = self.events.push(a, pr);
opt.is_none()
}
pub fn distributed_schedule_repeating(&mut self, agent: Box<dyn Agent>, the_time:f32, the_ordering:i32) -> (u32,bool) {
let mut a = AgentImpl::new(agent, self.agent_ids_counting);
self.agent_ids_counting +=1;
a.repeating = true;
let pr = Priority::new(the_time, the_ordering);
let opt = self.events.push(a, pr);
(self.agent_ids_counting-1, opt.is_none())
}
/// Return a vector of all the objects contained in the PriorityQueue
pub fn get_all_events(&self) -> Vec<Box<dyn Agent>>{
let mut tor: Vec<Box<dyn Agent>> = Vec::new();
for e in self.events.iter(){
tor.push(e.0.agent.clone());
}
tor
}
/// Remove an agent, if exist, from the PriorityQueue.
///
/// # Arguments
/// * `agent` - Agent to remove
/// * `my_id` - Id of the agent to remove
pub fn dequeue(&mut self, agent: Box<dyn Agent>, my_id: u32) -> bool {
let a = AgentImpl::new(agent, my_id);
let removed = self.events.remove(&a);
match removed {
//some if found and removed
Some(_) => {
// println!("Agent {} -- {} removed from the queue",a, my_id);
true
},
None => false,
}
}
/// Compute the step for each agent in the PriorityQueue.
///
/// # Arguments
/// * `state` - State of the simulation
pub fn step(&mut self, state: &mut dyn State){
if self.step == 0{
state.update(self.step);
}
state.before_step(self);
let events = &mut self.events;
if events.is_empty() {
println!("No agent in the queue to schedule. Terminating.");
//TODO check if we need to exit on 0 agents or we have to continue until new agents are spawned
// std::process::exit(0);
state.after_step(self);
self.step += 1;
state.update(self.step);
return;
}
let mut cevents: Vec<Pair> = Vec::new();
match events.peek() {
Some(item) => {
let (_agent, priority) = item;
self.time = priority.time;
},
None => panic!("Agent not found - out loop"),
}
loop {
if events.is_empty() {
break;
}
match events.peek() {
Some(item) => {
let (_, priority) = item;
if priority.time > self.time {
break;
}
let (agent, priority) = events.pop().expect("Error on pop from queue");
cevents.push(Pair::new(agent, priority));
},
None => panic!("Agent not found - inside loop"),
}
}
for mut item in cevents.into_iter() {
item.agentimpl.agent.before_step(state);
item.agentimpl.agent.step(state);
item.agentimpl.agent.after_step(state);
if item.agentimpl.repeating && !item.agentimpl.agent.is_stopped(state) {
self.schedule_once(
item.agentimpl,
item.priority.time + 1.0,
item.priority.ordering,
);
}
}
state.after_step(self);
self.step += 1;
state.update(self.step);
}
}
}
}
#[doc(hidden)]
/// A struct used to specify schedule options to pass to an agent's clone when an agent reproduces.
pub struct ScheduleOptions {
pub ordering: i32,
pub repeating: bool,
}