The study of list length effects (adding items to a list affects memory for the other items) and list strength effects (strengthening some items in a list affects memory for the nonstrengthened items) is important to constrain models of memory. In recognition memory, a list length effect is generally found, whereas a list strength effect is not. Using the switched-plurality procedure in an old-...

In this paper, a List Simulated Anneal (LSA) algorithm is proposed for the DAG tasks scheduling on the Network-on-chip to simultaneously optimize makespan, load balance and average link load. A task list is first created for the DAG tasks, and the task-to-processor assignment is performed using Best Fit rule. Then the generated schedule is further optimized using LSA. In LSA, the task execution...

Task scheduling is key issue in obtaining high performance in heterogeneous systems. Task scheduling in heterogeneous systems is a NP-problem, therefore several heuristic approaches were proposed to solve it. These heuristics are categorized into several classes, such as list based, clustering and task duplication scheduling. Here I consider the list scheduling approach. In this paper, I will h...

Many recent computational models of verbal short-term memory postulate a separation between processes supporting memory for the identity of items and processes supporting memory for their serial order. Furthermore, some of these models assume that memory for serial order is supported by a timing signal. We report an attempt to find evidence for such a timing signal by comparing an item probe ta...

List scheduling is the most frequently used scheduling technique. In this context worst case analysis as well as many experimental studies were performed for various computational models. However, many new models have been proposed during the last decade with the aim to provide a realistic but still simple and general model of parallel computation. LogP is one of the most popular models so far ...