| commit | 3ad577e51acef984bf9d1941eb975f137f88c896 | [log] [tgz] |
|---|---|---|
| author | Robertas Norkus <robertasn@google.com> | Fri Sep 03 08:53:44 2021 +0000 |
| committer | Robertas Norkus <robertasn@google.com> | Fri Sep 03 09:26:46 2021 +0000 |
| tree | 60da6653c391269fd1bb60559c698a5d4d023d3e | |
| parent | 702717bf2b18149f775f16f0a09d5ce823552cf2 [diff] |
Implement death test for WriteFile Add a death test which catches when WriteFile is given an invalid fd and dies due to it. Bug: 194172256 Test: dittobench_test Signed-off-by: Robertas Norkus <robertasn@google.com> Change-Id: Icd0734f28910bdb46ed1de1ec9416faa9c1b97a5
Dittosuite is a work in progress collection of tools that aims at providing a high-level language called Dittolang that defines operations.
The defined Dittolang operations can be interpreted by Dittosim for simulation to provide a simulated performance measurement and quickly identify the goodness of a solution.
Specularly, Dittobench interprets the Dittolang operations and executes them on a real device, tracking the behavior and measuring the performance.
The project is currently being developed as part of the Android Open Source Project (AOSP) and is supposed to run out-of-the-box.
The following utilities are required to build the project on Linux:
sudo apt install cmake protobuf-compiler
A suite of unit tests is provided in the test/ directory. In Linux these tests can be run with the following commands:
mkdir build cd build make cd test ctest
Bandwidth and measurement when dealing with few huge files or many small files. Operations are combinations of sequential/random-offset read/write.
Latency in creating/deleting files/folders.
These operations should be able to be triggered in a multiprogrammed fashion.
A graph of processes that are communicating with each others in a pipeline of operations that are parallely contributing to the generation of display frames.
Spawning tasks (period, duration, deadline) and verifying their scheduling latency and deadline misses count.
In the following scenario, two threads are running.
T1 runs the following operations: Read, Write, Read, sends a request to T2 and waits for the reply, then Write, Read. T2 waits for a request, then Read, Write, then sends the reply to the requester.
Operations are encoded as primitives expressed with ProtoBuffers. The definition of dependencies among threads can be represented as graphs.
The first graph traversal is performed at initialization time, when all the ProtoBuffer configuration files are distributed among all the binaries so that they can perform all the heavy initialization duties.
After the initialization phase completes the graph can be traversed again to put all the workloads in execution.
A final graph traversal can be performed to fetch all the measurements that each entity internally stored.
All the measurements must be ordered and later processed to provide useful information to the user.
T1: INIT : [ RD WR RD ] SND RCV [ WR RD ] : END T2: INIT : RCV [ RD WR ] SND : END
critical path [ READ WRITE READ ] [ READ WRITE ] [ WRITE READ ] --------------------> > < Thread1 III-XXXXXX|X-SSSSSS-XX-TTTT Thread2 III-XXXX|XXX-TTTT ^
> XXXXXXX XX<
XXXX
READ WRITE READ
--->
vector<instr*> {read(), write(), read()}; -> start()
RECEIVE READ WRITE READ SEND ---> vector<instr*> {receive(), read(), write(), read(), send()}; start()
lock on receive()