Java, modern uygulamalar\u0131n gerektirdi\u011fi y\u00fcksek performans ve \u00f6l\u00e7eklenebilirlik ihtiya\u00e7lar\u0131n\u0131 kar\u015f\u0131lamak \u00fczere tasarlanm\u0131\u015f g\u00fc\u00e7l\u00fc bir platformdur. \u00d6zellikle \u00e7ok \u00e7ekirdekli i\u015flemcilerin yayg\u0131nla\u015fmas\u0131yla birlikte, e\u015fzamanl\u0131 (concurrent) programlama, uygulamalar\u0131n kaynaklar\u0131 daha verimli kullanmas\u0131n\u0131 ve kullan\u0131c\u0131 deneyimini iyile\u015ftirmesini sa\u011flam\u0131\u015ft\u0131r. Ancak e\u015fzamanl\u0131 programlama, beraberinde karma\u015f\u0131k sorunlar\u0131 da getirir; bu sorunlardan biri de “deadlock” yani kilitlenmedir. Deadlock, birden fazla i\u015f par\u00e7ac\u0131\u011f\u0131n\u0131n (thread) birbirlerinin serbest b\u0131rakmas\u0131n\u0131 bekledi\u011fi ve bu nedenle hi\u00e7birinin ilerleyemedi\u011fi bir durumu ifade eder. Bu makalede, Java’daki deadlock kavram\u0131n\u0131, nas\u0131l olu\u015ftu\u011funu, \u00f6rneklerle a\u00e7\u0131klamas\u0131n\u0131, tespit y\u00f6ntemlerini ve en \u00f6nemlisi, bu can s\u0131k\u0131c\u0131 durumdan ka\u00e7\u0131nma ve \u00f6nleme stratejilerini ayr\u0131nt\u0131l\u0131 olarak inceleyece\u011fiz.<\/p>\n
G\u00fcn\u00fcm\u00fcz yaz\u0131l\u0131m sistemlerinde, birden fazla g\u00f6revin ayn\u0131 anda veya \u00e7ak\u0131\u015f\u0131k zaman dilimlerinde y\u00fcr\u00fct\u00fclmesi, performans\u0131 art\u0131rmak ve kullan\u0131c\u0131 aray\u00fczlerinin yan\u0131t verebilirli\u011fini s\u00fcrd\u00fcrmek i\u00e7in kritik \u00f6neme sahiptir. Java, * Veri Tutars\u0131zl\u0131\u011f\u0131 (Data Inconsistency):<\/strong> Birden fazla i\u015f par\u00e7ac\u0131\u011f\u0131 ayn\u0131 payla\u015f\u0131lan veriye ayn\u0131 anda eri\u015fip de\u011fi\u015ftirmeye \u00e7al\u0131\u015ft\u0131\u011f\u0131nda, veriler beklenmedik veya yanl\u0131\u015f bir duruma gelebilir. Bu zorluklar aras\u0131nda deadlock, uygulamalar\u0131n tamamen donmas\u0131na ve yan\u0131t vermemesine neden olabildi\u011fi i\u00e7in en y\u0131k\u0131c\u0131 olanlardan biridir. Bir uygulaman\u0131n kilitlenmesi, kullan\u0131c\u0131lar i\u00e7in k\u00f6t\u00fc bir deneyim yarat\u0131r ve sistem kaynaklar\u0131n\u0131n bo\u015fa harcanmas\u0131na yol a\u00e7ar.<\/p>\n Deadlock, iki veya daha fazla i\u015f par\u00e7ac\u0131\u011f\u0131n\u0131n, her birinin di\u011fer i\u015f par\u00e7ac\u0131klar\u0131n\u0131n tuttu\u011fu bir kayna\u011f\u0131 serbest b\u0131rakmas\u0131n\u0131 beklerken, ayn\u0131 zamanda kendisinin tuttu\u011fu bir kayna\u011f\u0131 serbest b\u0131rakmay\u0131 reddetti\u011fi bir durumdur. Bu durum, i\u015f par\u00e7ac\u0131klar\u0131n\u0131n sonsuz bir bekleme d\u00f6ng\u00fcs\u00fcne girmesine neden olur ve uygulaman\u0131n ilerlemesini tamamen durdurur.<\/p>\n Bu durumu bir analoji ile a\u00e7\u0131klayabiliriz: Dar bir yolda kar\u015f\u0131l\u0131kl\u0131 olarak ilerleyen iki ara\u00e7 d\u00fc\u015f\u00fcn\u00fcn. Her iki ara\u00e7 da yolun yar\u0131s\u0131na gelmi\u015f ve birbirlerinin ge\u00e7mesini bekliyor. Ancak yol o kadar dar ki, her ikisi de ayn\u0131 anda ge\u00e7emez. E\u011fer her iki s\u00fcr\u00fcc\u00fc de kendi yerinden geri gitmeyi reddederse, ikisi de kilitlenir ve yol sonsuza dek t\u0131kal\u0131 kal\u0131r. Java’da bu ara\u00e7lar i\u015f par\u00e7ac\u0131klar\u0131n\u0131, dar yol ise payla\u015f\u0131lan kaynaklar\u0131 (\u00f6rne\u011fin kilitler) temsil eder.<\/p>\n Deadlock’un ortaya \u00e7\u0131kmas\u0131 i\u00e7in d\u00f6rt temel ko\u015fulun ayn\u0131 anda sa\u011flanmas\u0131 gerekir. Bu ko\u015fullar genellikle Coffman Ko\u015fullar\u0131 olarak bilinir:<\/p>\n 1. Kar\u015f\u0131l\u0131kl\u0131 D\u0131\u015flama (Mutual Exclusion):<\/strong> Bir kayna\u011f\u0131n ayn\u0131 anda yaln\u0131zca bir i\u015f par\u00e7ac\u0131\u011f\u0131 taraf\u0131ndan kullan\u0131labilmesi. Yani, bir kaynak payla\u015f\u0131ml\u0131 de\u011fil, m\u00fcnhas\u0131ran kullan\u0131labilir olmal\u0131d\u0131r. Java’da 2. Beklerken Tutma (Hold and Wait):<\/strong> Bir i\u015f par\u00e7ac\u0131\u011f\u0131n\u0131n, zaten en az bir kayna\u011f\u0131 tutarken, ba\u015fka bir i\u015f par\u00e7ac\u0131\u011f\u0131 taraf\u0131ndan tutulan ek kaynaklar\u0131 bekliyor olmas\u0131. Yani, bir i\u015f par\u00e7ac\u0131\u011f\u0131 bir kayna\u011f\u0131 elinde tutarken, ba\u015fka bir kaynak i\u00e7in beklemede kal\u0131r.<\/p>\n 3. \u00d6nceliksiz Olma\/Kaynak Geri Al\u0131namazl\u0131\u011f\u0131 (No Preemption):<\/strong> Bir i\u015f par\u00e7ac\u0131\u011f\u0131 taraf\u0131ndan tutulan kaynaklar, i\u015f par\u00e7ac\u0131\u011f\u0131 kendi iste\u011fiyle serbest b\u0131rakmadan zorla geri al\u0131namaz. Kaynaklar ancak tutan i\u015f par\u00e7ac\u0131\u011f\u0131 g\u00f6revi tamamlad\u0131\u011f\u0131nda veya g\u00f6n\u00fcll\u00fc olarak b\u0131rakt\u0131\u011f\u0131nda serbest kal\u0131r.<\/p>\n 4. Dairesel Bekleme (Circular Wait):<\/strong> Bir i\u015f par\u00e7ac\u0131klar\u0131 zincirinin (P1, P2, …, Pn) var olmas\u0131, \u00f6yle ki P1, P2’nin tuttu\u011fu bir kayna\u011f\u0131 bekler; P2, P3’\u00fcn tuttu\u011fu bir kayna\u011f\u0131 bekler; ve bu b\u00f6yle devam eder, ta ki Pn, P1’in tuttu\u011fu bir kayna\u011f\u0131 bekleyene kadar. Bu, i\u015f par\u00e7ac\u0131klar\u0131n\u0131n birbirlerini dairesel bir \u015fekilde beklemesi durumudur.<\/p>\n Bu d\u00f6rt ko\u015fulun hepsi ayn\u0131 anda mevcut oldu\u011funda deadlock ka\u00e7\u0131n\u0131lmaz hale gelir. Deadlock’u \u00f6nlemek i\u00e7in bu ko\u015fullardan en az birini ortadan kald\u0131rmak yeterlidir.<\/p>\n \u015eimdi Java’da basit bir deadlock \u00f6rne\u011fi \u00fczerinde \u00e7al\u0131\u015fal\u0131m. Bu \u00f6rnekte, iki farkl\u0131 kilidi (kayna\u011f\u0131) s\u0131ras\u0131z bir \u015fekilde almaya \u00e7al\u0131\u015fan iki i\u015f par\u00e7ac\u0131\u011f\u0131 g\u00f6rece\u011fiz.<\/p>\n Bu kodu \u00e7al\u0131\u015ft\u0131rd\u0131\u011f\u0131n\u0131zda, genellikle a\u015fa\u011f\u0131daki gibi bir \u00e7\u0131kt\u0131 al\u0131rs\u0131n\u0131z:<\/p>\n Ve program bu noktadan sonra durur, \u00e7\u00fcnk\u00fc:<\/p>\n * Her iki i\u015f par\u00e7ac\u0131\u011f\u0131 da di\u011ferinin tuttu\u011fu kilidi bekledi\u011fi i\u00e7in, hi\u00e7biri ilerleyemez ve uygulama kilitlenir. Bu, dairesel bekleme ko\u015fulunun tipik bir \u00f6rne\u011fidir ve deadlock’a yol a\u00e7ar. Daha ger\u00e7ek\u00e7i bir senaryo olarak, banka hesaplar\u0131 aras\u0131nda para transferi yapan bir uygulamay\u0131 ele alal\u0131m.<\/p>\n Bu \u00f6rnekte, * Yine, her iki i\u015f par\u00e7ac\u0131\u011f\u0131 da di\u011ferinin tuttu\u011fu kilidi bekledi\u011fi i\u00e7in dairesel bekleme olu\u015fur ve sistem kilitlenir. Bu senaryo, ger\u00e7ek d\u00fcnya uygulamalar\u0131nda s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131labilecek bir deadlock durumunu g\u00f6stermektedir.<\/p>\n Deadlock’lar, genellikle \u00fcretim ortam\u0131nda ortaya \u00e7\u0131kt\u0131\u011f\u0131nda uygulamalar\u0131n yan\u0131t vermemesiyle fark edilir. Ancak, bir deadlock’un ger\u00e7ekten var olup olmad\u0131\u011f\u0131n\u0131 ve nerede oldu\u011funu tespit etmek i\u00e7in \u00e7e\u015fitli ara\u00e7lar ve teknikler mevcuttur.<\/p>\n K\u00fc\u00e7\u00fck ve basit uygulamalarda, kodun manuel olarak incelenmesi, potansiyel deadlock senaryolar\u0131n\u0131 ortaya \u00e7\u0131karabilir. \u00d6zellikle i\u00e7 i\u00e7e Java Virtual Machine (JVM), \u00e7al\u0131\u015fan bir uygulaman\u0131n o anki durumunu, t\u00fcm i\u015f par\u00e7ac\u0131klar\u0131n\u0131n stack izlerini (call stack) ve tuttuklar\u0131\/bekledikleri kilitleri i\u00e7eren bir “thread dump” olu\u015fturabilir. Bu, deadlock tespiti i\u00e7in en g\u00fc\u00e7l\u00fc ara\u00e7lardan biridir.<\/p>\n Bir thread dump’\u0131 a\u015fa\u011f\u0131daki yollarla olu\u015fturabilirsiniz:<\/p>\n * Bir thread dump \u00e7\u0131kt\u0131s\u0131nda, “Found one Java-level deadlock:” gibi ifadeler arayarak deadlock’lar\u0131 kolayca tespit edebilirsiniz. Bu mesaj\u0131n alt\u0131nda, hangi i\u015f par\u00e7ac\u0131klar\u0131n\u0131n hangi kilitleri bekledi\u011fi ve tuttu\u011fu ayr\u0131nt\u0131l\u0131 olarak listelenir.<\/p>\n \u00d6rnek bir thread dump \u00e7\u0131kt\u0131s\u0131 (deadlock k\u0131sm\u0131):<\/p>\n Bu \u00e7\u0131kt\u0131, JConsole, VisualVM gibi JDK ile birlikte gelen izleme ara\u00e7lar\u0131, \u00e7al\u0131\u015fan bir JVM’deki i\u015f par\u00e7ac\u0131klar\u0131n\u0131, kilitleri ve potansiyel deadlock’lar\u0131 grafiksel olarak izlemenizi sa\u011flar. Bu ara\u00e7lar, \u00f6zellikle geli\u015ftirme a\u015famas\u0131nda veya sorun giderme s\u0131ras\u0131nda \u00e7ok faydal\u0131d\u0131r. Ticari APM (Application Performance Management) ara\u00e7lar\u0131 da \u00fcretim ortam\u0131nda deadlock’lar\u0131 tespit edebilir ve uyar\u0131 verebilir.<\/p>\n Deadlock’lar\u0131 tespit etmek \u00f6nemlidir, ancak en iyi yakla\u015f\u0131m onlar\u0131 ba\u015ftan \u00f6nlemektir. Deadlock olu\u015fumu i\u00e7in gerekli d\u00f6rt ko\u015fuldan en az birini ortadan kald\u0131rarak deadlock’lar\u0131 engelleyebiliriz.<\/p>\n Bu ko\u015fulu tamamen ortadan kald\u0131rmak genellikle m\u00fcmk\u00fcn de\u011fildir, \u00e7\u00fcnk\u00fc \u00e7o\u011fu payla\u015f\u0131lan kayna\u011f\u0131n (bellek, dosya, veritaban\u0131 kayd\u0131) ayn\u0131 anda birden fazla i\u015f par\u00e7ac\u0131\u011f\u0131 taraf\u0131ndan g\u00fcvenli bir \u015fekilde de\u011fi\u015ftirilmesi engellenmelidir. E\u011fer bir kaynak payla\u015f\u0131ml\u0131 eri\u015fime izin verecek \u015fekilde tasarlanabiliyorsa (\u00f6rne\u011fin, salt okunur veriler veya atomik i\u015flemler), deadlock riski azal\u0131r. Ancak bu, kilitlerin temel amac\u0131na ayk\u0131r\u0131d\u0131r.<\/p>\n Bu ko\u015fulu k\u0131rmak i\u00e7in iki ana strateji vard\u0131r:<\/p>\n * T\u00fcm Kilitleri Ayn\u0131 Anda Alma (Acquire All Locks At Once):<\/strong> Bir i\u015f par\u00e7ac\u0131\u011f\u0131, herhangi bir kilit almadan \u00f6nce ihtiya\u00e7 duydu\u011fu t\u00fcm kilitleri ayn\u0131 anda almaya \u00e7al\u0131\u015f\u0131r. E\u011fer t\u00fcm kilitleri alamazsa, hi\u00e7birini almaz ve t\u00fcm kilitleri serbest b\u0131rakarak yeniden dener. Bu, Bu yakla\u015f\u0131m karma\u015f\u0131kl\u0131\u011f\u0131 art\u0131rabilir ve kaynak k\u0131tl\u0131\u011f\u0131na (starvation) yol a\u00e7abilir, \u00e7\u00fcnk\u00fc bir i\u015f par\u00e7ac\u0131\u011f\u0131 s\u00fcrekli olarak t\u00fcm kilitleri alamayabilir.<\/p>\n Bu ko\u015fulu k\u0131rmak, bir i\u015f par\u00e7ac\u0131\u011f\u0131n\u0131n tuttu\u011fu bir kilidin ba\u015fka bir i\u015f par\u00e7ac\u0131\u011f\u0131 taraf\u0131ndan zorla al\u0131nabilmesini sa\u011flamak anlam\u0131na gelir. Java’da Bu strateji, i\u015f par\u00e7ac\u0131klar\u0131n\u0131n sonsuz bekleme yerine zaman a\u015f\u0131m\u0131na u\u011framas\u0131n\u0131 ve geri \u00e7ekilmesini sa\u011flayarak deadlock riskini azalt\u0131r.<\/p>\n Bu, genellikle deadlock’lar\u0131 \u00f6nlemek i\u00e7in en pratik ve etkili stratejidir. T\u00fcm i\u015f par\u00e7ac\u0131klar\u0131n\u0131n kilitleri ayn\u0131, \u00f6nceden tan\u0131mlanm\u0131\u015f bir s\u0131rada almas\u0131n\u0131 sa\u011flayarak dairesel bekleme ko\u015fulunu ortadan kald\u0131r\u0131r\u0131z.<\/p>\n Kilit S\u0131ralamas\u0131 (Lock Ordering):<\/strong> Bu Java'n\u0131n * Deadlock'lardan ka\u00e7\u0131nmak i\u00e7in a\u015fa\u011f\u0131daki en iyi uygulamalar\u0131 takip etmek \u00f6nemlidir:<\/p>\n 1. Kilit Kapsam\u0131n\u0131 Daralt\u0131n (Minimize Lock Scope):<\/strong> Kilitleri m\u00fcmk\u00fcn olan en k\u0131sa s\u00fcre tutun. Bir kod blo\u011fu kilit alt\u0131nda ne kadar az zaman ge\u00e7irirse, di\u011fer i\u015f par\u00e7ac\u0131klar\u0131n\u0131n o kilidi bekleme olas\u0131l\u0131\u011f\u0131 o kadar azal\u0131r. Deadlock, e\u015fzamanl\u0131 programlaman\u0131n ka\u00e7\u0131n\u0131lmaz bir zorlu\u011fudur ve Java uygulamalar\u0131nda performans d\u00fc\u015f\u00fc\u015flerine ve kararl\u0131l\u0131k sorunlar\u0131na yol a\u00e7abilir. Ancak, deadlock'un temel ko\u015fullar\u0131n\u0131 (Kar\u015f\u0131l\u0131kl\u0131 D\u0131\u015flama, Beklerken Tutma, \u00d6nceliksiz Olma, Dairesel Bekleme) anlayarak ve bu ko\u015fullardan en az birini ortadan kald\u0131rmaya y\u00f6nelik stratejiler uygulayarak bu sorunlar\u0131n \u00f6n\u00fcne ge\u00e7mek m\u00fcmk\u00fcnd\u00fcr. Kilit s\u0131ralamas\u0131, Geli\u015ftiricilerin, e\u015fzamanl\u0131 kod yazarken dikkatli olmalar\u0131, kilit y\u00f6netimini iyi anlamalar\u0131 ve en iyi uygulamalar\u0131 takip etmeleri hayati \u00f6nem ta\u015f\u0131r. Ayr\u0131ca, Thread<\/code> s\u0131n\u0131f\u0131, synchronized<\/code> anahtar kelimesi ve java.util.concurrent<\/code> paketi gibi zengin bir e\u015fzamanl\u0131l\u0131k API’si sunarak geli\u015ftiricilere bu konuda g\u00fc\u00e7l\u00fc ara\u00e7lar sa\u011flar. Ancak bu g\u00fc\u00e7, do\u011fru kullan\u0131lmad\u0131\u011f\u0131nda tehlikeli sonu\u00e7lar do\u011furabilir. E\u015fzamanl\u0131 programlaman\u0131n getirdi\u011fi ba\u015fl\u0131ca zorluklar \u015funlard\u0131r:<\/p>\n
\n* Yar\u0131\u015f Durumu (Race Condition):<\/strong> \u0130\u015f par\u00e7ac\u0131klar\u0131n\u0131n \u00e7al\u0131\u015fma s\u0131ras\u0131n\u0131n \u00e7\u0131kt\u0131y\u0131 etkilemesi durumudur. Belirli bir s\u0131ran\u0131n garanti edilmemesi nedeniyle farkl\u0131 \u00e7al\u0131\u015ft\u0131rmalarda farkl\u0131 sonu\u00e7lar elde edilebilir.
\n* Kilitlenme (Deadlock):<\/strong> \u0130\u015f par\u00e7ac\u0131klar\u0131n\u0131n birbirini s\u00fcresiz olarak beklemesi ve hi\u00e7birinin ilerleyememesi durumudur.
\n* Ya\u015f Hissi (Livelock):<\/strong> \u0130\u015f par\u00e7ac\u0131klar\u0131n\u0131n me\u015fgul olmas\u0131na ra\u011fmen anlaml\u0131 bir ilerleme kaydedemedi\u011fi durumdur. Deadlock’tan farkl\u0131 olarak i\u015f par\u00e7ac\u0131klar\u0131 aktif olarak durumlar\u0131n\u0131 de\u011fi\u015ftirirler ancak d\u00f6ng\u00fcsel bir \u015fekilde.
\n* Kaynak K\u0131tl\u0131\u011f\u0131 (Resource Starvation):<\/strong> Bir veya daha fazla i\u015f par\u00e7ac\u0131\u011f\u0131n\u0131n gerekli kaynaklara s\u00fcrekli olarak eri\u015fememesi durumudur.<\/p>\nDeadlock Nedir?<\/h3>\n
Deadlock Olu\u015fumu \u0130\u00e7in Gerekli Ko\u015fullar (Coffman Ko\u015fullar\u0131)<\/h4>\n
synchronized<\/code> anahtar kelimesi veya Lock<\/code> aray\u00fcz\u00fc ile sa\u011flanan kilitler bu ko\u015fulu do\u011fal olarak sa\u011flar. Bir i\u015f par\u00e7ac\u0131\u011f\u0131 bir kilidi tuttu\u011funda, ba\u015fka bir i\u015f par\u00e7ac\u0131\u011f\u0131 o kilidi alamaz ve beklemek zorunda kal\u0131r.<\/p>\nJava’da Deadlock \u00d6rne\u011fi<\/h3>\n
public class DeadlockExample {\n\n private static final Object resource1 = new Object();\n private static final Object resource2 = new Object();\n\n public static void main(String[] args) {\n \/\/ Birinci i\u015f par\u00e7ac\u0131\u011f\u0131: resource1'i kilitler, sonra resource2'yi kilitler\n Thread thread1 = new Thread(() -> {\n synchronized (resource1) {\n System.out.println(\"Thread 1: resource1'i kilitledi.\");\n try {\n Thread.sleep(100); \/\/ Deadlock'u tetiklemek i\u00e7in gecikme\n } catch (InterruptedException e) {\n Thread.currentThread().interrupt();\n }\n System.out.println(\"Thread 1: resource2'yi kilitlemeyi bekliyor...\");\n synchronized (resource2) {\n System.out.println(\"Thread 1: resource2'yi kilitledi.\");\n }\n }\n }, \"Thread-1\");\n\n \/\/ \u0130kinci i\u015f par\u00e7ac\u0131\u011f\u0131: resource2'yi kilitler, sonra resource1'i kilitler\n Thread thread2 = new Thread(() -> {\n synchronized (resource2) {\n System.out.println(\"Thread 2: resource2'yi kilitledi.\");\n try {\n Thread.sleep(100); \/\/ Deadlock'u tetiklemek i\u00e7in gecikme\n } catch (InterruptedException e) {\n Thread.currentThread().interrupt();\n }\n System.out.println(\"Thread 2: resource1'i kilitlemeyi bekliyor...\");\n synchronized (resource1) {\n System.out.println(\"Thread 2: resource1'i kilitledi.\");\n }\n }\n }, \"Thread-2\");\n\n thread1.start();\n thread2.start();\n }\n}<\/code><\/pre>\nThread 1: resource1'i kilitledi.\nThread 2: resource2'yi kilitledi.\nThread 1: resource2'yi kilitlemeyi bekliyor...\nThread 2: resource1'i kilitlemeyi bekliyor...<\/code><\/pre>\nThread-1<\/code>, resource1<\/code>‘i kilitledi ve \u015fimdi resource2<\/code>‘yi bekliyor.
\n* Thread-2<\/code>, resource2<\/code>‘yi kilitledi ve \u015fimdi resource1<\/code>‘i bekliyor.<\/p>\nThread.sleep(100)<\/code> \u00e7a\u011fr\u0131s\u0131, i\u015f par\u00e7ac\u0131klar\u0131n\u0131n birbirlerini “yakalamas\u0131n\u0131” ve kilitleri ayn\u0131 anda farkl\u0131 s\u0131ralarda tutmas\u0131n\u0131 sa\u011flamak i\u00e7in eklenmi\u015ftir. Bu olmadan da deadlock olu\u015fabilir, ancak sleep<\/code> fonksiyonu bunu daha olas\u0131 hale getirir.<\/p>\nBankac\u0131l\u0131k Uygulamalar\u0131nda Deadlock \u00d6rne\u011fi<\/h4>\n
public class Account {\n private int balance;\n private final int id;\n\n public Account(int id, int balance) {\n this.id = id;\n this.balance = balance;\n }\n\n public int getBalance() {\n return balance;\n }\n\n public void deposit(int amount) {\n balance += amount;\n }\n\n public void withdraw(int amount) {\n balance -= amount;\n }\n\n public int getId() {\n return id;\n }\n}\n\npublic class TransferManager {\n\n public void transfer(Account fromAccount, Account toAccount, int amount) {\n \/\/ Kilit s\u0131ralamas\u0131: Her zaman ID'ye g\u00f6re k\u00fc\u00e7\u00fck olan hesab\u0131 \u00f6nce kilitle\n \/\/ Bu, deadlock'u \u00f6nlemek i\u00e7in bir stratejidir.\n \/\/ Ancak deadlock \u00f6rne\u011fi i\u00e7in, bu stratejiyi kas\u0131tl\u0131 olarak ihlal edece\u011fiz.\n\n \/\/ Deadlock'u olu\u015fturmak i\u00e7in rastgele kilit s\u0131ralamas\u0131 sim\u00fcle edelim\n Object lock1 = fromAccount;\n Object lock2 = toAccount;\n\n \/\/ Kilit s\u0131ralamas\u0131 ihlali i\u00e7in:\n \/\/ E\u011fer fromAccount.id > toAccount.id ise kilitleri yer de\u011fi\u015ftirerek\n \/\/ do\u011fal bir s\u0131ralama olmaks\u0131z\u0131n kilit al\u0131nmas\u0131n\u0131 sim\u00fcle edelim.\n \/\/ Ger\u00e7ek bir deadlock \u00f6rne\u011fi i\u00e7in bu k\u0131sm\u0131 kald\u0131rmam\u0131z veya de\u011fi\u015ftirmemiz gerekir.\n \/\/ Basit\u00e7e:\n \/\/ synchronized (fromAccount) { ... synchronized (toAccount) { ... } }\n \/\/ ve tersi:\n \/\/ synchronized (toAccount) { ... synchronized (fromAccount) { ... } }\n \/\/ durumlar\u0131n\u0131 yaratmam\u0131z gerekiyor.\n\n \/\/ Deadlock'u tetiklemek i\u00e7in iki thread'in farkl\u0131 kilit alma s\u0131ras\u0131 izlemesi gerekiyor\n \/\/ \u00d6rne\u011fin, transfer(acc1, acc2, X) ve transfer(acc2, acc1, Y) ayn\u0131 anda \u00e7a\u011fr\u0131ld\u0131\u011f\u0131nda:\n\n \/\/ Senaryo 1: fromAccount'\u0131 kilitle, sonra toAccount'\u0131 kilitle\n synchronized (fromAccount) {\n System.out.println(Thread.currentThread().getName() + \": \" + fromAccount.getId() + \" kilitlendi.\");\n try {\n Thread.sleep(100); \/\/ Deadlock'u art\u0131rmak i\u00e7in gecikme\n } catch (InterruptedException e) {\n Thread.currentThread().interrupt();\n }\n\n synchronized (toAccount) {\n System.out.println(Thread.currentThread().getName() + \": \" + toAccount.getId() + \" kilitlendi.\");\n if (fromAccount.getBalance() < amount) {\n System.out.println(Thread.currentThread().getName() + \": Yetersiz bakiye.\");\n return;\n }\n fromAccount.withdraw(amount);\n toAccount.deposit(amount);\n System.out.println(Thread.currentThread().getName() + \": \" + amount + \" transfer edildi. \" +\n fromAccount.getId() + \" bakiyesi: \" + fromAccount.getBalance() + \", \" +\n toAccount.getId() + \" bakiyesi: \" + toAccount.getBalance());\n }\n }\n }\n\n public static void main(String[] args) {\n Account acc1 = new Account(1, 1000);\n Account acc2 = new Account(2, 1000);\n\n TransferManager manager = new TransferManager();\n\n \/\/ Thread 1: acc1'den acc2'ye transfer\n Thread t1 = new Thread(() -> manager.transfer(acc1, acc2, 100), \"Transfer-1\");\n \/\/ Thread 2: acc2'den acc1'e transfer\n Thread t2 = new Thread(() -> manager.transfer(acc2, acc1, 200), \"Transfer-2\");\n\n t1.start();\n t2.start();\n }\n}<\/code><\/pre>\nTransferManager.transfer<\/code> metodunda synchronized (fromAccount)<\/code> ve synchronized (toAccount)<\/code> \u015feklinde i\u00e7 i\u00e7e kilitler kullan\u0131lm\u0131\u015ft\u0131r.<\/p>\nTransfer-1<\/code> i\u015f par\u00e7ac\u0131\u011f\u0131 acc1<\/code>‘i kilitler ve acc2<\/code>‘yi kilitlemeyi bekler.
\n* Transfer-2<\/code> i\u015f par\u00e7ac\u0131\u011f\u0131 acc2<\/code>‘yi kilitler ve acc1<\/code>‘i kilitlemeyi bekler.<\/p>\nDeadlock Tespiti<\/h3>\n
Manuel \u0130nceleme ve Kod G\u00f6zden Ge\u00e7irme<\/h4>\n
synchronized<\/code> bloklar\u0131 veya Lock<\/code> kullan\u0131mlar\u0131, kilit alma s\u0131ralamalar\u0131n\u0131n tutarl\u0131 olup olmad\u0131\u011f\u0131n\u0131 kontrol etmek i\u00e7in \u00f6nemlidir. Ancak karma\u015f\u0131k sistemlerde bu y\u00f6ntem yetersiz kal\u0131r.<\/p>\nThread Dump Analizi<\/h4>\n
jstack<\/code> arac\u0131:<\/strong> Java Development Kit (JDK) ile birlikte gelen jstack<\/code> komutu, \u00e7al\u0131\u015fan bir Java s\u00fcrecinin (process) thread dump’\u0131n\u0131 almak i\u00e7in kullan\u0131l\u0131r. jstack
\n* kill -3<\/code> komutu (Linux\/Unix):<\/strong> Linux veya Unix tabanl\u0131 sistemlerde, Java s\u00fcrecine kill -3
\n* Ctrl+Break (Windows):<\/strong> Windows’ta, konsolda \u00e7al\u0131\u015fan bir Java uygulamas\u0131 i\u00e7in Ctrl+Break tu\u015f kombinasyonuyla thread dump alabilirsiniz.<\/p>\nFound one Java-level deadlock:\n=============================\n\"Thread-2\":\n waiting for ownable synchronizer 0x0000000780f2d4f8 (a java.lang.Object)\n - waiting to lock <0x0000000780f2d4f8> (a java.lang.Object) owned by \"Thread-1\"\n\"Thread-1\":\n waiting for ownable synchronizer 0x0000000780f2d508 (a java.lang.Object)\n - waiting to lock <0x0000000780f2d508> (a java.lang.Object) owned by \"Thread-2\"\n\nJava stack information for the threads listed above:\n===================================================\n\"Thread-2\":\n at DeadlockExample.lambda$main$1(DeadlockExample.java:31)\n - waiting to lock <0x0000000780f2d4f8> (a java.lang.Object)\n - locked <0x0000000780f2d508> (a java.lang.Object)\n at DeadlockExample$$Lambda$2\/0x0000000800060800.run(Unknown Source)\n at java.base\/java.lang.Thread.run(Thread.java:834)\n\"Thread-1\":\n at DeadlockExample.lambda$main$0(DeadlockExample.java:18)\n - waiting to lock <0x0000000780f2d508> (a java.lang.Object)\n - locked <0x0000000780f2d4f8> (a java.lang.Object)\n at DeadlockExample$$Lambda$1\/0x0000000800060400.run(Unknown Source)\n at java.base\/java.lang.Thread.run(Thread.java:834)\n\nFound 1 deadlock.<\/code><\/pre>\nThread-2<\/code>‘nin 0x...4f8<\/code> adresindeki objeyi (resource1) bekledi\u011fini ve bu objenin Thread-1<\/code> taraf\u0131ndan tutuldu\u011funu g\u00f6sterir. Ayn\u0131 zamanda Thread-1<\/code>‘in 0x...508<\/code> adresindeki objeyi (resource2) bekledi\u011fini ve bu objenin Thread-2<\/code> taraf\u0131ndan tutuldu\u011funu g\u00f6sterir. Bu, a\u00e7\u0131k\u00e7a bir deadlock durumudur.<\/p>\n\u0130zleme Ara\u00e7lar\u0131<\/h4>\n
Deadlock \u00d6nleme Stratejileri<\/h3>\n
1. Kar\u015f\u0131l\u0131kl\u0131 D\u0131\u015flamay\u0131 Ortadan Kald\u0131rma<\/h4>\n
2. Beklerken Tutmay\u0131 Ortadan Kald\u0131rma<\/h4>\n
java.util.concurrent.locks.Lock<\/code> aray\u00fcz\u00fcn\u00fcn tryLock()<\/code> metodu ile uygulanabilir. tryLock()<\/code> belirli bir s\u00fcre i\u00e7inde kilidi alamazsa false<\/code> d\u00f6ner.<\/p>\nif (lock1.tryLock()) {\n try {\n if (lock2.tryLock()) {\n try {\n \/\/ \u0130\u015flemi yap\n } finally {\n lock2.unlock();\n }\n } else {\n \/\/ lock2 al\u0131namad\u0131, lock1'i serbest b\u0131rak ve yeniden dene\n lock1.unlock();\n \/\/ Gerekirse bekle ve tekrar dene\n }\n } finally {\n \/\/ lock1'in tryLock'tan sonra serbest b\u0131rak\u0131ld\u0131\u011f\u0131ndan emin ol\n }\n }<\/code><\/pre>\n3. \u00d6nceliksiz Olmay\u0131 Ortadan Kald\u0131rma (Preemption)<\/h4>\n
synchronized<\/code> anahtar kelimesiyle al\u0131nan kilitler \u00f6nceliksiz de\u011fildir. Ancak ReentrantLock<\/code> gibi java.util.concurrent.locks<\/code> paketi i\u00e7indeki kilitler, tryLock(long timeout, TimeUnit unit)<\/code> metodu ile bu ko\u015fulu k\u0131rmaya yard\u0131mc\u0131 olabilir. Bir i\u015f par\u00e7ac\u0131\u011f\u0131, belirli bir s\u00fcre i\u00e7inde kilidi alamazsa, mevcut kilidini serbest b\u0131rak\u0131p geri \u00e7ekilebilir ve daha sonra tekrar deneyebilir.<\/p>\nReentrantLock lock1 = new ReentrantLock();\nReentrantLock lock2 = new ReentrantLock();\n\n\/\/ ...\n\nif (lock1.tryLock(100, TimeUnit.MILLISECONDS)) {\n try {\n if (lock2.tryLock(100, TimeUnit.MILLISECONDS)) {\n try {\n \/\/ \u0130\u015flemi yap\n } finally {\n lock2.unlock();\n }\n } else {\n \/\/ lock2 al\u0131namad\u0131, lock1'i serbest b\u0131rak\n lock1.unlock();\n \/\/ Geri \u00e7ekil ve tekrar dene\n }\n } catch (InterruptedException e) {\n Thread.currentThread().interrupt();\n } finally {\n \/\/ lock1'in tryLock'tan sonra serbest b\u0131rak\u0131ld\u0131\u011f\u0131ndan emin ol\n if (lock1.isHeldByCurrentThread()) { \/\/ Sadece tutuyorsa serbest b\u0131rak\n lock1.unlock();\n }\n }\n}<\/code><\/pre>\n4. Dairesel Beklemeyi Ortadan Kald\u0131rma<\/h4>\n
\n\u00d6nceki banka transferi \u00f6rne\u011finde, e\u011fer her zaman hesap ID’sine g\u00f6re k\u00fc\u00e7\u00fck olan hesab\u0131 \u00f6nce kilitlersek, dairesel bekleme olu\u015fmaz.<\/p>\npublic void transferSafe(Account fromAccount, Account toAccount, int amount) {\n Object lock1 = fromAccount;\n Object lock2 = toAccount;\n\n \/\/ Kilitleri ID'ye g\u00f6re s\u0131rala\n if (fromAccount.getId() < toAccount.getId()) {\n lock1 = fromAccount;\n lock2 = toAccount;\n } else {\n lock1 = toAccount;\n lock2 = fromAccount;\n }\n\n synchronized (lock1) {\n System.out.println(Thread.currentThread().getName() + \": \" + ((Account)lock1).getId() + \" kilitlendi.\");\n try {\n Thread.sleep(100);\n } catch (InterruptedException e) {\n Thread.currentThread().interrupt();\n }\n\n synchronized (lock2) {\n System.out.println(Thread.currentThread().getName() + \": \" + ((Account)lock2).getId() + \" kilitlendi.\");\n \/\/ Ger\u00e7ek transfer mant\u0131\u011f\u0131\n if (fromAccount.getBalance() < amount) {\n System.out.println(Thread.currentThread().getName() + \": Yetersiz bakiye.\");\n return;\n }\n fromAccount.withdraw(amount);\n toAccount.deposit(amount);\n System.out.println(Thread.currentThread().getName() + \": \" + amount + \" transfer edildi. \" +\n fromAccount.getId() + \" bakiyesi: \" + fromAccount.getBalance() + \", \" +\n toAccount.getId() + \" bakiyesi: \" + toAccount.getBalance());\n }\n }\n}\n\n\/\/ main metodunda:\n\/\/ Thread 1: manager.transferSafe(acc1, acc2, 100)\n\/\/ Thread 2: manager.transferSafe(acc2, acc1, 200)\n\/\/ Her iki durumda da \u00f6nce acc1 (ID=1) kilitlenir, sonra acc2 (ID=2).\n\/\/ Bu, dairesel beklemeyi ortadan kald\u0131r\u0131r.<\/code><\/pre>\ntransferSafe<\/code> metodu, fromAccount<\/code> ve toAccount<\/code>'\u0131 do\u011frudan kilitlemek yerine, \u00f6nce ID'lerine g\u00f6re s\u0131ralar ve her zaman daha k\u00fc\u00e7\u00fck ID'li hesab\u0131 \u00f6nce kilitler. Bu, kilit alma s\u0131ras\u0131n\u0131 standartla\u015ft\u0131r\u0131r ve dairesel beklemeyi ortadan kald\u0131r\u0131r.<\/p>\njava.util.concurrent Paketinin Kullan\u0131m\u0131<\/h4>\n
java.util.concurrent<\/code> paketi, e\u015fzamanl\u0131 programlama sorunlar\u0131n\u0131 ele almak i\u00e7in g\u00fc\u00e7l\u00fc ve esnek ara\u00e7lar sunar. Bu ara\u00e7lar, synchronized<\/code> bloklar\u0131n\u0131n s\u0131n\u0131rlamalar\u0131n\u0131 a\u015farak deadlock riskini azaltmaya yard\u0131mc\u0131 olabilir:<\/p>\nReentrantLock<\/code>:<\/strong> synchronized<\/code> anahtar kelimesine g\u00f6re daha fazla esneklik sunar. tryLock()<\/code> metodu ile bir kilidi belirli bir s\u00fcre i\u00e7inde almaya \u00e7al\u0131\u015fabilir ve ba\u015far\u0131s\u0131z olursa geri \u00e7ekilebilirsiniz. Ayr\u0131ca lockInterruptibly()<\/code> ile kilit beklerken i\u015f par\u00e7ac\u0131\u011f\u0131n\u0131n kesintiye u\u011framas\u0131na izin verir.
\n* Semaphore<\/code>:<\/strong> Belirli bir kayna\u011fa ayn\u0131 anda ka\u00e7 i\u015f par\u00e7ac\u0131\u011f\u0131n\u0131n eri\u015febilece\u011fini s\u0131n\u0131rlamak i\u00e7in kullan\u0131l\u0131r. Kaynak havuzlar\u0131 (connection pool) gibi durumlarda faydal\u0131d\u0131r.
\n* CountDownLatch<\/code>, CyclicBarrier<\/code>:<\/strong> \u0130\u015f par\u00e7ac\u0131klar\u0131n\u0131n belirli bir noktaya kadar birbirlerini beklemesini sa\u011flayan senkronizasyon yard\u0131mc\u0131lar\u0131d\u0131r. Do\u011frudan deadlock \u00f6nlemede kullan\u0131lmasalar da, karma\u015f\u0131k e\u015fzamanl\u0131 ak\u0131\u015flar\u0131 y\u00f6neterek dolayl\u0131 olarak riskleri azaltabilirler.
\n* ExecutorService<\/code>:<\/strong> \u0130\u015f par\u00e7ac\u0131klar\u0131n\u0131 do\u011frudan y\u00f6netmek yerine bir havuzdan al\u0131p g\u00f6revleri y\u00fcr\u00fctmek, kaynak y\u00f6netimini merkezile\u015ftirir ve potansiyel hatalar\u0131 azalt\u0131r.<\/p>\nEn \u0130yi Uygulamalar (Best Practices)<\/h3>\n
\n2. De\u011fi\u015fmez Nesneler Kullan\u0131n (Prefer Immutable Objects):<\/strong> M\u00fcmk\u00fcn oldu\u011funca de\u011fi\u015fmez (immutable) nesneler kullan\u0131n. De\u011fi\u015fmez nesnelerin durumu olu\u015fturulduktan sonra de\u011fi\u015fmez, bu da payla\u015f\u0131lan eri\u015fim i\u00e7in kilitlenmeye gerek olmad\u0131\u011f\u0131 anlam\u0131na gelir.
\n3. java.util.concurrent<\/code> Paketini Tercih Edin:<\/strong> Karma\u015f\u0131k e\u015fzamanl\u0131 senaryolarda, synchronized<\/code> anahtar kelimesi yerine ReentrantLock<\/code>, Semaphore<\/code> gibi java.util.concurrent<\/code> ara\u00e7lar\u0131n\u0131 kullan\u0131n. Bu ara\u00e7lar daha fazla kontrol ve esneklik sunar.
\n4. \u0130\u00e7 \u0130\u00e7e Kilitlerden Ka\u00e7\u0131n\u0131n (Avoid Nested Locks):<\/strong> M\u00fcmk\u00fcnse i\u00e7 i\u00e7e kilitlerden ka\u00e7\u0131n\u0131n. E\u011fer birden fazla kilit almak zorundaysan\u0131z, kilit alma s\u0131ras\u0131n\u0131 kesinlikle standartla\u015ft\u0131r\u0131n ve belgeleyin.
\n5. Kilit S\u0131ralamas\u0131n\u0131 Belgeleyin:<\/strong> E\u011fer uygulaman\u0131zda birden fazla kilit kullan\u0131l\u0131yorsa, bu kilitlerin hangi s\u0131rayla al\u0131nmas\u0131 gerekti\u011fini a\u00e7\u0131k\u00e7a belgeleyin ve t\u00fcm geli\u015ftiricilerin bu kurala uymas\u0131n\u0131 sa\u011flay\u0131n.
\n6. Zaman A\u015f\u0131m\u0131 Kullan\u0131n (Use Timeouts):<\/strong> ReentrantLock<\/code>'un tryLock(long timeout, TimeUnit unit)<\/code> gibi metotlar\u0131n\u0131 kullanarak kilit beklemelerine zaman a\u015f\u0131m\u0131 ekleyin. Bu, i\u015f par\u00e7ac\u0131klar\u0131n\u0131n s\u00fcresiz olarak beklemesini engeller ve geri \u00e7ekilme mekanizmalar\u0131 olu\u015fturman\u0131za olanak tan\u0131r.
\n7. Kapsaml\u0131 Testler Yap\u0131n:<\/strong> E\u015fzamanl\u0131 uygulamalar\u0131 birim testleri, entegrasyon testleri ve \u00f6zellikle stres testleri ile kapsaml\u0131 bir \u015fekilde test edin. Deadlock'lar genellikle belirli y\u00fck ve zamanlama ko\u015fullar\u0131 alt\u0131nda ortaya \u00e7\u0131kar.<\/p>\nSonu\u00e7<\/h3>\n
tryLock<\/code> ile zaman a\u015f\u0131m\u0131 mekanizmalar\u0131 ve java.util.concurrent<\/code> paketinin sa\u011flad\u0131\u011f\u0131 geli\u015fmi\u015f ara\u00e7lar, deadlock'lar\u0131 \u00f6nlemede en etkili y\u00f6ntemlerdir.<\/p>\njstack<\/code> gibi ara\u00e7larla thread dump analizi yapabilme yetene\u011fi, \u00fcretim ortam\u0131nda ortaya \u00e7\u0131kan deadlock'lar\u0131 h\u0131zl\u0131 bir \u015fekilde te\u015fhis etmek i\u00e7in de\u011ferli bir beceridir. G\u00fcvenilir ve y\u00fcksek performansl\u0131 Java uygulamalar\u0131 geli\u015ftirmek i\u00e7in deadlock mekanizmalar\u0131n\u0131 derinlemesine anlamak ve proaktif \u00f6nlemler almak \u015fartt\u0131r. Bu sayede, uygulaman\u0131z\u0131n beklenmedik durmalar\u0131n\u0131 engelleyebilir ve kullan\u0131c\u0131lar\u0131n\u0131za kesintisiz bir deneyim sunabilirsiniz.<\/body><\/p>\n","protected":false},"excerpt":{"rendered":"Java’da Deadlock: Kilitlenmenin Derinlemesine \u0130ncelenmesi ve \u00c7\u00f6z\u00fcm Yollar\u0131\nJava, modern uygulamalar\u0131n gerektirdi\u011fi y\u00fcksek performans ve \u00f6l\u00e7","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"csco_page_header_type":"","csco_page_load_nextpost":"","csco_page_subscribe_form":"","csco_page_contact_form":"","footnotes":""},"categories":[1408],"tags":[],"class_list":{"0":"post-31439","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-java","7":"cs-entry","8":"cs-video-wrap"},"yoast_head":"\n