Added stuff, somehow biblatex fails to compile?

tex/misc/background_draft.bib

@@ -344,8 +344,7 @@
   url={https://lkml.org/lkml/2008/4/29/480},
   journal={lkml.org},
   author={Ven, Arjan van de},
-  year={2008},
-  month={Apr}
+  year={2008}
 }
 
 @inproceedings{Li_etal.RelDB_RDMA.2016,
@@ -356,3 +355,38 @@
   year={2016}
 }
 
+@article{Hong_etal.NUMA-to-RDMA-DSM.2019,
+  title={Scaling out NUMA-aware applications with RDMA-based distributed shared memory},
+  author={Hong, Yang and Zheng, Yang and Yang, Fan and Zang, Bin-Yu and Guan, Hai-Bing and Chen, Hai-Bo},
+  journal={Journal of Computer Science and Technology},
+  volume={34},
+  pages={94--112},
+  year={2019},
+  publisher={Springer}
+}
+
+@inproceedings{Kaxiras_etal.DSM-Argos.2015,
+  author = {Kaxiras, Stefanos and Klaftenegger, David and Norgren, Magnus and Ros, Alberto and Sagonas, Konstantinos},
+  title = {Turning Centralized Coherence and Distributed Critical-Section Execution on their Head: A New Approach for Scalable Distributed Shared Memory},
+  year = {2015},
+  isbn = {9781450335508},
+  publisher = {Association for Computing Machinery},
+  address = {New York, NY, USA},
+  url = {https://doi.org/10.1145/2749246.2749250},
+  doi = {10.1145/2749246.2749250},
+  abstract = {A coherent global address space in a distributed system enables shared memory programming in a much larger scale than a single multicore or a single SMP. Without dedicated hardware support at this scale, the solution is a software distributed shared memory (DSM) system. However, traditional approaches to coherence (centralized via "active" home-node directories) and critical-section execution (distributed across nodes and cores) are inherently unfit for such a scenario. Instead, it is crucial to make decisions locally and avoid the long latencies imposed by both network and software message handlers. Likewise, synchronization is fast if it rarely involves communication with distant nodes (or even other sockets). To minimize the amount of long-latency communication required in both coherence and critical section execution, we propose a DSM system with a novel coherence protocol, and a novel hierarchical queue delegation locking approach. More specifically, we propose an approach, suitable for Data-Race-Free programs, based on self-invalidation, self-downgrade, and passive data classification directories that require no message handlers, thereby incurring no extra latency. For fast synchronization we extend Queue Delegation Locking to execute critical sections in large batches on a single core before passing execution along to other cores, sockets, or nodes, in that hierarchical order. The result is a software DSM system called Argo which localizes as many decisions as possible and allows high parallel performance with little overhead on synchronization when compared to prior DSM implementations.},
+  booktitle = {Proceedings of the 24th International Symposium on High-Performance Parallel and Distributed Computing},
+  pages = {3-14},
+  numpages = {12},
+  location = {Portland, Oregon, USA},
+  series = {HPDC '15}
+}
+
+@misc{FreeBSD.man-BPF-4.2021, 
+  title={FreeBSD manual pages}, 
+  url={https://man.freebsd.org/cgi/man.cgi?query=bpf&manpath=FreeBSD+14.0-RELEASE+and+Ports}, 
+  journal={BPF(4) Kernel Interfaces Manual}, 
+  publisher={The FreeBSD Project}, 
+  author={The FreeBSD Project}, 
+  year={2021}
+}