Amutheezan

Amutheezan

Postdoctoral Fellow

Ceu Language

less than 1 minute read

Published:

Ceu is a pretty cool language that was developed around 2014 by a research team at Lablua. It was developed mainly to reduce the time delay caused by libraries used in Arduino based on polling systems. [POLLING is the repeated querying of a system until a particular task is achieved or the system stops based on a given criterion.] Most real-time systems are developed around the concept of polling, but this comes at a cost in time and energy.

This Ceu language was used to create an Arduino binding through Ceu-Arduino, which helps resolve those issues through its functionalities. Those functionalities are listed below.

  • Awaiting events in a direct/sequential style.
  • Parallel lines of execution with safe abortion.
  • Deterministic behavior (in contrast with threads).
  • Asynchronous loops for heavy computations.
  • Interrupt-driven operation mode (optional and experimental).
  • Seamless integration with standard Arduino.

References

  1. https://github.com/fsantanna/ceu-arduino

You May Also Enjoy

Time Complexity of Single-Source Shortest Path Algorithms

5 minute read

Published:

Graph data structures are widely used to represent different aspects of computer science (e.g., road networks). We can denote a graph as \(G = (V, E)\), where \(V\) represents the set of vertices (in the context of a road network, these represent intersections), and \(E\) represents the set of edges (representing road segments). We generally define \(n~(= |V|)\) as the number of vertices and \(m~(= |E|)\) as the number of edges to express the time and space complexity of graph algorithms. One such problem is single-source shortest path (SSSP), which is used to find the shortest path from a single node to all other nodes. For decades, Dijkstra’s algorithm has been the go-to method for solving this problem. The runtime of Dijkstra’s algorithm depends on the priority queue implementation and often has a complexity of \(O(m + n \log n)\). Read more

CPU/GPU/TPU Performance Comparison

7 minute read

Published:

I have implemented a simple comparison of performance on Google Colab CPU, GPU, and TPU as part of an assignment for COSC 6385 course at the University of Houston. Read more

Spectre Vulnerability Simulation

2 minute read

Published:

In this post, I share some details on my extension to a simple simulation for the Spectre attack as part of the assignment for COSC 6385 course at the University of Houston. Read more

Meltdown Vulnerability Simulation

5 minute read

Published:

I have implemented a simple simulation for the Meltdown vulnerability as part of the assignment for COSC 6385 course at the University of Houston. Read more