Art of Programming

By
I have been wondering whether my blog has more to do with art than practical purpose. I say this because I want to blog to simulate ideas rather than be a how to guide on things which most people will possibly never have a need for.

There are only two reasons we create art: for ourselves and for others
-- Brenda Behr

Art has no other purpose than to brush aside... the conventional and accepted generalities, in short everything that veils reality from us, in order to bring us face to face with reality itself.
-- Henri Bergson

Art is the perpetual motion of illusion. The highest purpose of art is to inspire. What else can you do? What else can you do for any one but inspire them?
-- Bob Dylan

Art for art's sake, with no purpose, for any purpose perverts art. But art achieves a purpose which is not its own.
― Benjamin Constant, 1804

My view is that art cannot be created purposely, and it has no direct function. However, it has an important role which is to stimulate creative thinking and stimulate a positive mind set.

Computer science and engineering is often seen as all about creating software with a purpose, so art may be forgotten. Computer science is a adolescent science and I would argue art plays its part in simulating innovation and improving productivity. How are we to find innovation and productivity which can make a dramatic different to performance, user experience or lower development times? I would say this is where art plays an important role.

Every child is an artist. The problem is how to remain an artist once we grow up
-- Pablo Picasso

In computer science, there is so much to learn all the time. There is constant change. Children acquire knowledge very easily compared with adults and I think its important to approach computer science like a child to keep up and to develop new ideas.

How do we do this?

  • Work on interesting things which will stimulate and challenge you for its own sake.
  • Take time out regularly to try new ideas
  • When you come back to your work, keep the momentum and excitement
  • Look for opportunities to improve things and improve them, don't wait to be asked.
    Do it for your own sake (and for the sake of the project)
  • If you have children, look at the way they learn. You could learn something from them.

 

Life is Art
-- anon.

Comments

  1. Tolea20 March 2012 at 12:55

    "Computer science is a adole*s*cent science"

    ReplyDelete
  2. Peter Lawrey20 March 2012 at 16:16

    @Tolea, Thank you.

    ReplyDelete
  3. C21 March 2012 at 22:24

    I read some years ago, that keeping up with the latest in software development, is doing the equivalent of studying for a bachelor's degree every two years.

    If this is true, I must be into a double digit BSc count by now!

    ReplyDelete
  4. Peter Lawrey22 March 2012 at 06:42

    I am often bemused by the idea you can learn a language, or even become and expert, in a few weeks. I think ten years is a better estimate of how long it takes to become an expert. But even so, you can't stop learning or you may find a move into management is on your career path so you can use your experience to help others.

    ReplyDelete

Post a Comment

Popular posts from this blog

Java is Very Fast, If You Don’t Create Many Objects

By
Image
  You still have to watch how many objects you create. This article looks at a benchmark passing events over TCP/IP at 4 billion events per minute using the net.openhft.chronicle.wire.channel package in Chronicle Wire and why we still avoid object allocations..  One of the key optimisations is creating almost no garbage. Allocation is a very cheap operation and collection of very short-lived objects is also very cheap. Does this really make a difference? What difference does one small object per event (44 bytes) make to the performance in a throughput test where GC pauses are amortised? While allocation is as efficient as possible, it doesn’t avoid the memory pressure on the L1/L2 caches of your CPUs and when many cores are busy, they are contending for memory in the shared L3 cache.  Results Benchmark on a Ryzen 5950X with Ubuntu 22.10. JVM Vendor, Version No objects Throughput, Average Latency* One object per event Throughput, Average Latency* Azul Zulu 1.8.0_322 60.6 M event/s, 528
Read more

System wide unique nanosecond timestamps

By
A Unique Identifier can be very useful for tracing. Those ids are even more useful when they contain a high-resolution timestamp.  Not only do they record the time of an event, but if unique can help trace events as they pass through the system. Such unique timestamps however can be expensive depending on how they are implemented.   This post explores a lightweight means of producing a unique, monotonically increasing system-wide nano-second resolution timestamp available in our open-source library. Uses for Unique Identifiers Unique identifiers can be useful to associate with a piece of information so that information can be referred to later unambiguously. This could be an event, a request, an order id, or a customer id. They can naturally be used as a primary key in a database or key/value store to retrieve that information later. One of the challenges of generating these identifiers is avoiding creating duplicates while not having an increasing cost.  You could record every identi
Read more

Comparing Approaches to Durability in Low Latency Messaging Queues

By
Image
  A significant feature of Chronicle Queue Enterprise is support for TCP replication across multiple servers to ensure the high availability of application infrastructure. I generally believe that replicating data to a secondary system is faster than syncing to disk, assuming the round trip network delay wasn’t high due to quality networks and co-located redundant servers. This is the first time I have benchmarked it with a realistic example. Little’s Law and Why Latency Matters In many cases, the assumption is that the latency won't be a problem as long as throughput is high enough. However, latency is often a key factor in why the throughput isn’t high enough. Little’s law states, “ the long-term average number  L  of customers in a  stationary  system is equal to the long-term average effective arrival rate  λ  multiplied by the average time  W  that a customer spends in the system”. In computer terminology, the level of concurrency or parallelism a system has to support must be
Read more