I’ll describe a few patterns that enabled me to process 2 billions items per day using Azure Functions. Yes 2 billions items per day. The aim of this trial was not to check whether you can do it with Azure Functions. You can do it easily. The goal was to do it in a cost-aware and cost-wise manner, enabling fast processing with a small amount of money spent on this.
dotnetomaniak.pl - Artykuły z tagiem performance
![[EN] Utilizing Save-Data client hint in ASP.NET Core MVC]()
![git log - optymalizacja - Norbert Rozmus]()
![Linq - optymalizacja Single oraz Last - Norbert Rozmus]()
![F# vs C#: a performance comparison with BenchmarkDotNet – Youenn Bouglouan]()
![ProtobufRaw vs protobuf-net | Szymon Kulec `Scooletz`]()
![Z tym warto się zapoznać #2 - PoznajProgramowanie.pl]()
![Want unlimited scale and performance? This is where to start – IndexOutOfRange]()
![Dividing a bit in two for performance – IndexOutOfRange]()
![[EN] Entity Framework 6 - Dynamically creating temporary tables from IQueryable (Part 2 of 2)]()
![Making bits faster – IndexOutOfRange]()
![Independent code in performance optimizations – IndexOutOfRange]()
![Using bit masks for high-performance calculations – IndexOutOfRange]()
![[EN] Entity Framework 6 - Dynamically creating temporary tables from IQueryable (Part 1 of 2)]()
![[EN] The ugly truth behind pretty URLs]()
![[EN] Problems with AsParallel – IndexOutOfRange]()
![Hryniewski.NET | Trzy słowa o optymalizacji LINQ]()
![[EN]Debugging high memory usage. Part 2 - .NET Memory Profiler – IndexOutOfRange]()
![[EN] Debugging high memory usage. Part 1 - ProcDump – IndexOutOfRange]()
![[EN] The cost of garbage collection – IndexOutOfRange]()
performance
Save-Data request header is a client hint which indicates that client would like to reduce data usage. This post shows how it can be used in ASP.NET Core MVC.
Źródło:
www.tpeczek.com
Dziel się z innymi:
Performance! Jak dobrać odpowiedni typ danych do postawionego zadania. We wpisie analiza różnych typów kolekcji w kontekście budowania drzewa commitów.
Daj się poznać 2017 1221 dni, 15 godzin, 14 minut temu 41 źrodło rozwiń
We wpisie omówiona zostanie obecna implementacja metod Single oraz Last w pakiecie Linq. Zaproponowane zostaną również zoptymalizowana wersje obu metod.
Daj się poznać 2017 1221 dni, 15 godzin, 14 minut temu 262 źrodło rozwiń
A simple performance comparison between approaches encouraged by F# (immutability and functional programming) and C# (mutability and OOP). Which one would you choose?
Daj się poznać 2017 1235 dni, 14 godzin, 46 minut temu 112 źrodło rozwiń
Podczas pracy nad moim nowym projektem SewingMachine zacząłem zastanawiać się, czy w szczególnych wypadkach, serializacja obiektów nie mogłaby zachodzić szybciej. Zachęcam do poznania podejścia, które pozwala na 10x (słownie: dziesięć razy) szybszą serializację, zgodną z formatem protobuf-net.
Źródło:
blog.scooletz.com
Dziel się z innymi:
Paczka wartościowych materiałów, które możecie znaleźć w sieci. Jeżeli chcesz zapoznać się z pozostałymi ciekawymi linkami możesz zrobić to tutaj...
Reading time ~10 minutes This article is Part 2 in a 2-Part Series. Part 1 - What is the simplest database?Part 2 - This Article The previous post laid out the most minimum requirements for something to be called a database. While they may be too bare bones for many, there are a lot of databases that don’t fulfill even half of them, and this isn’t stopping from using them on a daily basis. The last time I’ve looked at files, this time something a bit more complex - key-value databases. The idea be...
Źródło:
indexoutofrange.com
Dziel się z innymi:
Architektura 1266 dni, 15 godzin, 9 minut temu 43 źrodło rozwiń
Reading time ~4 minutes This post is an analysis of a very interesting optimization proposed by Nicholas Frechette in the comments under the previous post. He proposed to use one of the oldest tricks in performance cookbook - divide and conquer. Well, it did not turn out as I expected.Saga Before I go further here are some link to the previous posts on the problem of calculating similarities and then optimizing. This thread grew to a few post. Here are all of them:How I calculate similariti...
Sztuka programowania 1349 dni, 5 godzin, 5 minut temu 78 źrodło rozwiń
In previous post I've shown how a temporary table can be generated based on IQueryable and then reused in subsequent queries. I have also pointed out a serious limitation. The goal of this post is to address that limitation and touch on unit testing aspect.
Reading time ~2 minutes This post was inspired by a discussion on Reddit that followed my previous post In this post, I will cover a suggestion by BelowAverageITGuy that cut down the total execution time by almost one hour. Saga Before I go further here are some link to the previous posts on the problem of calculating similarities and then optimizing it grew to few post. Here are all of them:How I calculate similarities in cookit?How to calculate 17 billion similaritiesIndependent code in ...
Sztuka programowania 1360 dni, 13 godzin, 21 minut temu 94 źrodło rozwiń
Reading time ~1 minute This will be a fast errata to the previous one. This time I will expand the oldest performance mantra: The fastest code is the one that doesn’t execute. Second to that is the one that executes once Last time I’ve forgot to mention one very important optimization. It was one of two steps that allowed me to go from 1530 to 484 seconds in the sample run.Saga Before I go further here are some link to the previous posts on the problem of calculating similarities and then...
Programowanie rozproszone 1373 dni, 14 godzin, 50 minut temu 46 źrodło rozwiń
Reading time ~6 minutes Last time I’ve shown how I’ve gone from 34 hours to 11. This time we go faster. To go faster I have to do less. The current implementation of Similarity iterates over one vector and checks if that ingredient exists in the second one. Since those vectors are sparse the chance of a miss is big. This means that I am losing computational power on iterating and calling TryGetValue. How to iterate only over the mutually owned ones and do it fast? Saga Before I go furth...
Sztuka programowania 1370 dni, 14 godzin, 30 minut temu 58 źrodło rozwiń
I'm a huge fan of entity based and result set based relational mapping (classic ORMs). I'm also huge fan of DML based relational mapping (micro ORMs). In general I'm a huge fan of every technology that allows me to get the job done in the best possible way. I believe that one should never limit himself to single approach within a project - it should always be about choosing the best tool for the job. But sometimes there are real life constraints (licensing, business, politics etc.) which are limiting the...
Attribute routing (RouteAttribute) is a quite handy feature of ASP.NET MVC. It allows you to have nice looking URLs that everybody has already accustomed to and your client surely loves it. Plus it hides your true controller/action structure which sometimes might be desirable. But there's one catch. As your web app gets bigger and bigger, attribute routing might have a negative performance impact on your WHOLE website.
Reading time ~6 minutes This post is covering a subset of what I am talking in my talk How I stopped worrying and learned to love parallel processing (currently only in polish). This will cover on how, in terms of performance, AsParallel can kick you in a place where it hurts a lot, simultaneously being a blessing in terms of… performance. How is that? Let’s look at someHistory AsParallel was introduced as an extension to LINQ with TPL in .NET 4.0. In theory, it’s God’s sent. The promise w...
Architektura 1386 dni, 11 godzin, 23 minuty temu 116 źrodło rozwiń
Kontynuując wątek LINQ, który podjąłem jakiś czas temu, poruszę dziś temat optymalizacji operacji jakie wykonujemy na kolekcjach. Na starcie muszę się przyznać, że tytuł nie jest do końca zgodny z prawdą, bo trzy słowa to o wiele za mało, by wejść w głębiej w temat optymalizacji zapytań. Są jednak 3 metody, które można wykorzystać do znacznego przyspieszenia wykonywania operacji w bardziej rozbudowanych łańcuchach przy minimalnym nakładzie pracy.
Źródło:
hryniewski.net
Dziel się z innymi:
Reading time ~4 minutes Diagnosing high memory usage can be tricky, here is the second part of how I found what was hogging to much memory in our system. In the previous post I’ve wrote how to create a memory dump and how many possibilities of catching just the right moment for it ProcDump has. When trying to analyze memory leaks, or high memory usage (not necessary meaning a leak) we have a few ways to approach it: Attach a debugger There are many problems with this approach, to name a fe...
Źródło:
indexoutofrange.com
Dziel się z innymi:
Reading time ~2 minutes I’m taking a short break from Hangfire series, but I will get back to it. This time - Where did my memory go ? Or to be more exact: Why is this using so much memory? The story starts with one IIS application pool using around 6 Gigabytes of memory on one of our test environments. It was several times above the values that we expected it to use, so we decided to investigate. Without much thinking we fired up Visual Studio installed on the test server, and attached to the proce...
Źródło:
indexoutofrange.com
Dziel się z innymi:
Architektura 1445 dni, 15 godzin, 2 minuty temu 64 źrodło rozwiń
Just how long does garbage collection take in .NET? Which generation takes longer?
Sztuka programowania 1504 dni, 10 godzin, 45 minut temu 123 źrodło rozwiń
Polecamy
Nadchodzące wydarzenia
Najaktywniejsi
.Net
.net core
architektura
ASP .NET
asp.net
Asp.Net Core
ASP.NET MVC
Azure
C#
C# .NET
certyfikacja
certyfikat
cloud
daj sie poznac 2017
Daj się poznać
Daj Się Poznać 2017
dajsiepoznac
DDD
docker
dotnet
dsp2017
egzamin
Entity Framework
F#
git
JavaScript
jQuery
konferencja
Linq
mvc
MVVM
Narzędzia
performance
praca
programowanie
SharePoint
Silverlight
SQL
sql server
TDD
testy
Visual Studio
Visual Studio 2010
WCF
Windows
Windows 8
windows phone
WPF
Wzorce projektowe
Xamarin