For a change, I will start with a good soundtrack (youtube version for those who are spotify-less) This is my third article about the distributed coordination language Linda. The final target of the work is to use this coordination mechanism to deploy and maintain applications based on the description of their topology (using, for example, TOSCA as a DSL). Last time, I introduced a lisp based language (zygomys) as an embedded programing mechanism to describe the business logic.

In this post I will explain how to: Parse a CSV file and extract only certain columns Create a table in DynamoDB Insert all the data with an adaptive algorithm in order to use the provisioned capacity Reduce the capacity once the insertion is done. Exploring the problem: AWS Billing In a previous post I explained how I was using dynamodb to store a lot of data about aws billing.

The title is not a typo nor dyslexia. I will really talk about Lisp. In a previous post I explained my will to implement the dining of the philosophers with Linda in GO. The ultimate goal is to use a distributed and abstract language to go straight from the design to the runtime of an application. The problem I’ve faced I want to use a GO implementation for the Linda language because a go binary is a container by itself.