{{helpme}} I wonder if I am allowed to make an article about a special, deadlock free software pattern. I would look much towards the wiki:Bakery algorithm arti
|
{{helpme}} I wonder if I am allowed to make an article about a special, deadlock free software pattern. I would look much towards the wiki:Bakery algorithm article, also see wiki:Deadlock.
The problem is that I have published this pattern, see chapter 10 of From message queue to ready queue by Øyvind Teig. I have also discussed it in two newer, published papers. A dr. student at the university here asked me the other day if that pattern was something I had invented, because he had not seen it documented. I don't know, and I will be very careful indeed, about that question.
However, that pattern is valuable for software designers, as one out of several building blocks for concurrent systems. I urge to say that this is not research, it's a patterns that has been used for several years. I would imagine that this pattern must have been used many times in the life of concurrent or multi-threaded systems - since the sixties?
I am thinking about giving it a name.
Am I allowed to start such an article?
Øyvind Teig (talk) 07:53, 10 March 2009 (UTC)
See User_talk:Beetstra#Possible_conflict_of_interest_links
Hi Aclassifier! The thread you created at the Wikipedia:Teahouse, You can still read the archived discussion. If you have follow-up questions, please .
|
Hi Aclassifier! I noticed that you recently marked an edit as minor at Tony Hoare that may not have been. "Minor edit" has a specific definition on Wikipedia—it refers only to superficial edits that could never be the subject of a dispute, such as typo corrections or reverting obvious vandalism. Any edit that changes the meaning of an article is not a minor edit, even if it only concerns a single word. Thank you. —andrybak (talk) 17:21, 10 July 2024 (UTC)

Hi. Thank you for your recent edits. An automated process has detected that when you recently edited Vector processor, you added a link pointing to the disambiguation page VPU. Such links are usually incorrect, since a disambiguation page is merely a list of unrelated topics with similar titles. (Read the FAQ • Join us at the DPL WikiProject.)
It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, --DPL bot (talk) 19:54, 26 December 2025 (UTC)
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.