Language complexity on the synchronous anonymous ring
نویسندگان
چکیده
منابع مشابه
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case
The distributed bit complexity of an asynchronous network of processors is a lower bound on the worst case bit complexity of computing any noo-constant function of the inputs to the processors [MW]. This concept attempts to capture the amount of communication required for any "useful" computation on the network. The aim of this kind of research is to characterize networks by their bit complexit...
متن کاملthe effect of task cognitive complexity and time limit on the performance of the learners with different proficiency levels in second language writing skill
this study investigated the effects of manipulating the cognitive complexity of tasks along +/- few elements and the time limits on l2 learners writing performance. to conduct the study, 60 iranian efl learners with two levels of proficiency, low and high intermediate, were selected and assigned to three groups based on the time devoted to task completion. the participants performed both a simp...
15 صفحه اولthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولBetter Computing on the Anonymous Ring
We consider a bidirectional ring of n processors, where processors are anonymous, i.e., are indistinguishable. In this model it is known that “most” functions (in particular XOR and orientation) have worst case message complexity @(n’) for asynchronous computations, and O(n log n) for synchronous computations. The average case behavior is different; an algorithm that computes XOR asynchronously...
متن کاملOn the time and the bit complexity of distributed randomised anonymous ring colouring
We present and analyse a very simple randomised distributed vertex colouring algorithm for ring graphs. Its time complexity is log2 n + o(log n) on average and 2log2 n + o(log n) with probability 1− o(n). Each message containing 1 bit we deduce the same values for its bit complexity. Then we compose this algorithm with another and we obtain a 3-colouring algorithm for ring graphs. Thanks to an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1987
ISSN: 0304-3975
DOI: 10.1016/0304-3975(87)90062-4